DocumentCode
1406558
Title
Database management with sequence trees and tokens
Author
Goldstein, Robert C. ; Wagner, Christian
Author_Institution
Fac. of Commerce & Bus. Adm., British Columbia Univ., Vancouver, BC, Canada
Volume
9
Issue
1
fYear
1997
Firstpage
186
Lastpage
192
Abstract
An approach to organizing storage in database systems is presented that, under a wide range of conditions, saves both storage space and processing time. Text values in a database are replaced by short, fixed-length, rank-preserving numeric tokens. The actual values are stored in separate, non-redundant storage. Database operations that depend only on the relative magnitude of data values can be performed directly on the tokens. Tokenization is shown to improve database performance most in situations where there are a lot of ad hoc queries and a low volume of database insertions relative to other operations
Keywords
abstract data types; database management systems; database theory; query processing; sequences; software performance evaluation; tree data structures; abstract data types; ad hoc queries; database insertions; database management; database operations; database performance; database systems storage organization; fixed-length rank-preserving numeric tokens; nonredundant storage; processing time; relative data value magnitude; sequence trees; storage space saving; text values; tokenization; Bandwidth; Binary sequences; Database systems; Encoding; Energy management; Indexing; Organizing; Performance analysis; Spatial databases; Technology management;
fLanguage
English
Journal_Title
Knowledge and Data Engineering, IEEE Transactions on
Publisher
ieee
ISSN
1041-4347
Type
jour
DOI
10.1109/69.567062
Filename
567062
Link To Document