Database management with sequence trees and tokens
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 186-192 |
Journal / Publication | IEEE Transactions on Knowledge and Data Engineering |
Volume | 9 |
Issue number | 1 |
Publication status | Published - 1997 |
Link(s)
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, nonredundant 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. © 1997 IEEE.
Research Area(s)
- Abstract data types, Database management, Design, File organization, Performance, Tokenization
Citation Format(s)
Database management with sequence trees and tokens. / Goldstein, Robert C.; Wagner, Christian.
In: IEEE Transactions on Knowledge and Data Engineering, Vol. 9, No. 1, 1997, p. 186-192.
In: IEEE Transactions on Knowledge and Data Engineering, Vol. 9, No. 1, 1997, p. 186-192.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review