Affiliation:
1. Univ. of California, Berkeley
Abstract
A new file structure for attribute based retrieval is proposed in this paper. It allows queries involving arbitrary Boolean functions of the attribute-value pairs to be processed without taking intersections of lists. The structure is highly dependent on the way in which the file is to be used and is uniquely determined by the specification of the allowed queries. Thus, for example, the structure for retrieval on the basis of ranges of values on a given attribute would be very different from one where only retrieval on the basis of a single value is permitted.
The file organization being proposed is based on the atoms of a Boolean algebra generated by the queries. The desirable properties claimed for this structure are proved, and file maintenance questions are discussed.
Publisher
Association for Computing Machinery (ACM)
Cited by
55 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Granular Computing, Information Models for;Encyclopedia of Complexity and Systems Science Series;2023
2. Granular Computing, Information Models for;Encyclopedia of Complexity and Systems Science;2020
3. Deductive Data Mining Using Granular Computing;Encyclopedia of Database Systems;2018
4. Deductive Data Mining Using Granular Computing;Encyclopedia of Database Systems;2017
5. Unifying Variable Precision and Classical Rough Sets: Granular Approach;Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam;2013