ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Bit-Tree: a data structure for fast file processing
Full text PdfPdf (3.23 MB)
Source
Communications of the ACM archive
Volume 35 ,  Issue 6  (June 1992) table of contents
Pages: 114 - 120  
Year of Publication: 1992
ISSN:0001-0782
Author
David E. Ferguson  Amalgamated Software of North America, Inc., P.O. Box 1668, 611 Spruce Road, Big Bear Lake, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 55,   Citation Count: 4
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/129888.129896
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Bayer, R., and McCreight, E, Organization .and maintenance of large ordered indexes, Acta Inform. 1, 3 (I972), 173-i89.
2
Rudolf Bayer , Karl Unterauer, Prefix B-trees, ACM Transactions on Database Systems (TODS), v.2 n.1, p.11-26, March 1977  [doi>10.1145/320521.320530]
3
Douglas Comer, Ubiquitous B-Tree, ACM Computing Surveys (CSUR), v.11 n.2, p.121-137, June 1979  [doi>10.1145/356770.356776]
 
4
Guibas, L., and Sedgewick, R. A dichromatic framework for balanced. trees. In Proceedings of the 19th Symp Foundations of Computer Science, 1978, 8-21.
 
5
Howard and Borgendale, System/38 machine indexing support, IBM System/38 Technical Developments, 1980, 67-69.
 
6
Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
7
Donald R. Morrison, PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric, Journal of the ACM (JACM), v.15 n.4, p.514-534, Oct. 1968  [doi>10.1145/321479.321481]

CITED BY  4
Alan L. Tharp , John L. Furlani, The CD-ROM foster a new data structure: the B3-tree, Proceedings of the 1993 ACM conference on Computer science, p.466-471, February 16-18, 1993, Indianapolis, Indiana, United States
Peter Bumbulis , Ivan T. Bowman, A compact B-tree, Proceedings of the 2002 ACM SIGMOD international conference on Management of data, June 03-06, 2002, Madison, Wisconsin
Roberto Grossi , Ankur Gupta , Jeffrey Scott Vitter, High-order entropy-compressed text indexes, Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, January 12-14, 2003, Baltimore, Maryland
Philip Bohannon , Peter Mcllroy , Rajeev Rastogi, Main-memory index structures with fixed-size partial keys, ACM SIGMOD Record, v.30 n.2, p.163-174, June 2001

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.3 Information Search and Retrieval
          Subjects: Search process

Additional Classification:
  D. Software
  D.4 OPERATING SYSTEMS
      D.4.3 File Systems Management
          Subjects: File organization

  E. Data
  E.1 DATA STRUCTURES
      Subjects: Trees
  E.5 FILES
      Subjects: Sorting/searching


General Terms:
Algorithms, Performance


Keywords:
B-Tree, Bit-Tree, ISAM, branch, distinction bit, index, information retrieval, leaf, mode, random access, root, trie

Collaborative Colleagues:
David E. Ferguson: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player