[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

Canonical structure in attribute based file organization

Published: 01 September 1971 Publication History

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.

References

[1]
Hsiao, D., and Harary, F. A formal system for information retrieval from files. Comm. ACM 13, 2 (Feb. 1970), 67-73.
[2]
Abraham, C. T., Ghosh, S. P., and Ray-Chaudhuri, D. K. File organization schemes based on finite geometrics, Inform. Contr. 12 (1968), 143-163.
[3]
Chow, D. K., New balanced-file organization schemes. Inform. Contr. 15 (1969), 377-396.
[4]
Halmos, P. R. Measure Theory. Van Nostrand, Princeton, N.J., 1950.
[5]
Quine, W. V., The problem of simplifying truth functions. Amer. Math. Monthly 59 (1952), 521-531.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Communications of the ACM
Communications of the ACM  Volume 14, Issue 9
Sept. 1971
36 pages
ISSN:0001-0782
EISSN:1557-7317
DOI:10.1145/362663
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1971
Published in CACM Volume 14, Issue 9

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Boolean functions
  2. Boolean queries
  3. address calculation
  4. atoms of Boolean algebra
  5. attributes
  6. file organization
  7. information retrieval
  8. inverted file
  9. key words
  10. multilist
  11. queries
  12. searches

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)69
  • Downloads (Last 6 weeks)16
Reflects downloads up to 10 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Granular Computing: Practices, Theories, and Future DirectionsGranular, Fuzzy, and Soft Computing10.1007/978-1-0716-2628-3_256(199-219)Online publication date: 30-Mar-2023
  • (2023)Granular Computing, Information Models forGranular, Fuzzy, and Soft Computing10.1007/978-1-0716-2628-3_252(147-160)Online publication date: 30-Mar-2023
  • (2020)Granular Computing, Information Models forEncyclopedia of Complexity and Systems Science10.1007/978-3-642-27737-5_252-4(1-14)Online publication date: 29-May-2020
  • (2018)Deductive Data Mining Using Granular ComputingEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_767(1026-1034)Online publication date: 7-Dec-2018
  • (2017)Deductive Data Mining Using Granular ComputingEncyclopedia of Database Systems10.1007/978-1-4899-7993-3_767-2(1-8)Online publication date: 4-Aug-2017
  • (2013)Unifying Variable Precision and Classical Rough Sets: Granular ApproachRough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam10.1007/978-3-642-30341-8_19(365-373)Online publication date: 2013
  • (2012)Granular Computing: Practices, Theories, and Future DirectionsComputational Complexity10.1007/978-1-4614-1800-9_89(1404-1420)Online publication date: 2012
  • (2012)Granular Computing, Information Models forComputational Complexity10.1007/978-1-4614-1800-9_85(1369-1376)Online publication date: 2012
  • (2009)Qualitative fuzzy sets: Context based reasoning system in GrCNAFIPS 2009 - 2009 Annual Meeting of the North American Fuzzy Information Processing Society10.1109/NAFIPS.2009.5156469(1-5)Online publication date: Jun-2009
  • (2009)Granular computing and flow analysis on discretionary access control: Solving the propagation problem2009 IEEE International Conference on Systems, Man and Cybernetics10.1109/ICSMC.2009.5345955(2965-2971)Online publication date: Oct-2009
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media