A formal system for information retrieval from files
Communications of the ACM
Towards a Better Understanding of Data Models Through the Multilingual Database System
IEEE Transactions on Software Engineering
Bell and LaPadula axioms: a “new” paradigm for an “old” model
NSPW '92-93 Proceedings on the 1992-1993 workshop on New security paradigms
NSPW '92-93 Proceedings on the 1992-1993 workshop on New security paradigms
Optimality Properties of Multiple-Key Hashing Functions
Journal of the ACM (JACM)
The use of normal multiplication tables for information storage and retrieval
Communications of the ACM
Information retrieval in files described using sets
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Incorporation of relevance feedback into Boolean retrieval systems
SIGIR '82 Proceedings of the 5th annual ACM conference on Research and development in information retrieval
An attribute-based file organization for a relational database
ACM '76 Proceedings of the 1976 annual conference
On the use of bit maps for multiple key retrieval
Proceedings of the 1976 conference on Data : Abstraction, definition and structure
Partial-match queries and file designs
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
Recent results on the attribute based data model: a tutorial
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
Using partitioned databases for statistical data analysis
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
IBM Systems Journal
A theoretical background for applying fuzzy set theory in information retrieval
Fuzzy Sets and Systems
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Bibliography on data base structures
ACM SIGMIS Database
| Hi-index | 48.23 |
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.