An integrated data structure with multiple access paths for database systems

ABSTRACT

This article presents an integrated data structure which offers multiple access paths for processing different types of queries efficiently. The data structure is developed by fusing the B+ - tree, the grid file and extendible hashing structures using a proper interface. We show that this type of data structure is an efficient way for providing multiple access paths to data.

REFERENCES

• 1: Albert Burger , Vijay Kumar , Patricia Simpson, An Integrated Data Structure with Multiple Access Paths, Proceedings of the IFIP TC2/WG 2.6 Second Working Conference on Visual Database Systems II, p.301-315, September 30-October 03, 1991
• 2: Betty Salzberg, Grid file concurrency, Information Systems, v.11 n.3, p.235-244, 1986 [doi>10.1016/0306-4379(86)90031-1]
• 3: J. Nievergelt , Hans Hinterberger , Kenneth C. Sevcik, The Grid File: An Adaptable, Symmetric Multikey File Structure, ACM Transactions on Database Systems (TODS), v.9 n.1, p.38-71, March 1984 [doi>10.1145/348.318586]
• 4: Ronald Fagin , Jurg Nievergelt , Nicholas Pippenger , H. Raymond Strong, Extendible hashing—a fast access method for dynamic files, ACM Transactions on Database Systems (TODS), v.4 n.3, p.315-344, Sept. 1979 [doi>10.1145/320083.320092]
• 5: Henry F. Korth , Abraham Silberschatz, Database system concepts, McGraw-Hill, Inc., New York, NY, 1986
• 6: Nancy E. Miller, File Structures Using Pascal, Benjamin-Cummings Publishing Co., Inc., Redwood City, CA, 1987

INDEX TERMS

Primary Classification:
  E. Data
  E.1 DATA STRUCTURES
      Subjects: Trees

Additional Classification:
  E. Data
  E.2 DATA STORAGE REPRESENTATIONS
      Subjects: Hash-table representations

  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.4 Systems
          Subjects: Query processing

General Terms:
Theory