The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Algorithms for parsing search queries in systems with inverted file organization
ACM Transactions on Database Systems (TODS)
The use of normal multiplication tables for information storage and retrieval
Communications of the ACM
Analysis and performance of inverted data base structures
Communications of the ACM
A survey of physical database design methodology and techniques
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
| Hi-index | 0.00 |
A range attribute is defined as an attribute that may assume a range of values. Examples might be Age = (1--10, 11--14, 15--16, ...) or Salary = (0-1000, 1001-1500, ...). This paper is concerned with the selection of ranges that will produce reasonably uniform numbers of records in each range. A set of algorithms has been developed to enable the file designer to obtain a set of ranges such that records are distributed uniformly between the ranges. Although in a given case perfect uniformity may not be achievable, the algorithms can find ranges such that for a set of X records in a range, bounds a and b may be given so that a ≤ X ≤ b for all ranges. The algorithms have been tested with a PASCAL program.