Abstract
A major performance goal of a DBMS is to minimize the number of I/O’s (i.e., blocks or pages transferred) between the disk and main memory. One way to achieve this goal is to minimize the number of I/O’s when answering a query. Note that many queries reference only a small portion of the records in a database file. For example the query: “find the employees who reside in Santa Monica” references only a fraction of the records in the Employee relation. It would be very inefficient to have the database system sequentially read all the pages of the Employee file and check the residence field of each employee record for the name “Santa Monica”. Instead the system should be able to locate the pages with “Santa Monica” employee records directly. To allow such fast access additional data structures called access methods are designed per database file. There are two fundamental access methods, namely indexing and hashing. The most widely used indexing scheme is the B+-tree. Hashing is also common, in particular in its Extendible and Linear Hashing schemes. We also describe two multi-attribute access methods, the k-d tree and the Grid File. Finally, we discuss an approach that is popular for document searching, the Inverted File.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bayer, R. and McCreight, E.M. (1972) Organization and Maintenance of Large Ordered Indices. Acta Informatica, 1(3):173–189.
Bentley, J.L. (1975). Multidimensional Binary Search Trees Used for Associative Searching. Communications of the ACM, 18(9):509–517.
Bentley, J.L. (1979). Multidimensional Binary Search Trees in Database Applications. IEEE Transactions on Software Engineering, 5(4):333–340.
Bertino E, Ooi, B.C., Sacks-Davis, Tan, K.L., R., Zobel, J., Shidlovski, B., and Catania, B. (1997). Indexing Techniques for Advanced Database Systems. Kluwer Academic Publishers.
Comer, D. (1979). The Ubiquitous B-tree. ACM Computing Surveys, 11(2):121–137.
Cormen, T.H., Leiserson, C.E., and Rivest, R.L. (1990). Introduction to Algorithms. MIT Press.
Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer, E, Rohnhert, H., and Tarjan, R. (1988). Dynamic Perfect Hashing: Upper and Lower Bounds. In (cnProceedings of the 29 th IEEE Symposium on Foundations on Computer Science, pages 524–531.
Enbody, R.J. and Du, H.C. (1988). Dynamic Hashing Schemes. ACM Computing Surveys, 20(2):85–113.
Elmasri, R. and Navathe, S. (1999). Fundamentals of Database Systems, 3rd Edition. Benjamin/Cummings.
Evangelidis, G., Lomet, D., and Salzberg, B. (1995). The hBII-tree: a Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation. In Proceedings of the 21 st International Conference on Very Large Data Bases, pages 551–561.
Fagin, R., Nievergelt, J., Pippenger, N., and Strong, H.R. (1979). Extendible Hashing: a Fast Access Method for Dynamic Files. ACM Transactions on Database Systems, 4(3):315–344.
Faloutsos, C. (1985). Access Methods for Text. ACM Computing Surveys, 17(1):49–74.
Faloutsos, C. and Christodoulakis, S. (1987). Optimal Signature Extraction and Information Loss. ACM Transactions on Database Systems, 12(3):395–428.
Fiat, A., Naor, M., Schmidt, J.P., and Siegel, A. (1992). Nonoblivious Hashing. Journal of the ACM, 39(4):764–782.
Folk, M.J., Zoellick, B., and Riccardi, G. (1998). File Structures. Addisson Wesley.
Foltz, P.W. and Dumais, S.T. (1992). Personalized Information Delivery: an Analysis of Information Filtering Methods. Communications of the ACM, 35(12):51–60.
Freeston, M. (1987). The BANG File: A New Kind of Grid File. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 260–269.
Larson, P.A. (1978) Dynamic Hashing. BIT, 18:184–201.
Larson, P.A. (1982). Performance Analysis of Linear Hashing with Partial Expansions. ACM Transactions on Database Systems, 7(4):566–587.
Litwin, W. (1980). Linear Hashing: a New Tool for File and Table Addressing. In Proceedings of the 6 th International Conference on Very Large Data Bases, pages 212–223.
Litwin, W., Neimat, M.A., and Schneider, D.A. (1996). LH*: a Scalable, Distributed Data Structure. ACM Transactions on Database Systems, 21(4):480–525.
Livadas. P. (1990). File Structures: Theory and Practice, Prentice Hall.
Lo, M-L. and Ravishankar, C.V. (1996). Spatial Hash-Joins. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 247–258.
Manolopoulos, Y., and Lorentzos, N. (1994). Performance of Linear Hashing Schemes for Primary Key Retrieval. Information Systems, 19(5):433–446.
Nievergelt, J., Hinterberger, H., and Sevcik, K.C. (1984) The Grid File: an Adaptable Symmetric Multikey File Structure. ACM Transactions on Database Systems, 9(1):38–71.
Ramakrishnan, R. (1997). Database Management Systems, 1st edition. McGraw-Hill.
Robinson, J.T. (1981). The k-d B-tree: a Search Structure for Large Multidimensional Dynamic Indexes. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 10–18.
Salton, G. (1989) Automatic Text Processing. Addison-Wesley.
Salzberg, B. (1988). File structures. Prentice Hall.
Seeger, B. and Kriegel, H-P. (1990). The Buddy-tree: an Efficient and Robust Access Method for Spatial Database Systems. In Proceedings of the 16 th International Conference on Very Large Data Bases, pages 590–601.
Sevcik, K.C. and Koudas, N. (1996) Filter Trees for Managing Spatial Data over a Range of Size Granularities. In Proceedings of the 22 nd International Conference on Very Large Data Bases, pages 16–27.
Schneider, D.A. and DeWitt, D.J. (1990). Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines. In Proceedings of the 16 th International Conference on Very Large Data Bases, pages 469–480.
Silberchatz, A., Korth, H.F., Sudarshan, S. (1999). Database System Concepts, 3rd edition. McGraw-Hill.
Smith, P. and Barnes, M. (1987). Files and Databases. Addison-Wesley.
Tharp, A. (1988). File Organization and Processing. Wiley.
Weiderhold, G. (1987). File Organizations for database Design. McGraw Hill.
Zobel, J., Moffat, A., and Sacks-Davis, R. (1992). An Efficient Indexing Technique for Full Text Databases. In Proceedings of the 18 th International Conference on Very Large Data Bases, pages 352–362.
Zobel, J., Moffat, A., and Ramamohanarao, K. (1998). Inverted Files vs. Signature Files for Text Indexing. ACM Transactions on Database Systems, 23(4):453–490.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Manolopoulos, Y., Theodoridis, Y., Tsotras, V.J. (2000). Fundamental Access Methods. In: Advanced Database Indexing. Advances in Database Systems, vol 17. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8590-3_3
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8590-3_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4641-8
Online ISBN: 978-1-4419-8590-3
eBook Packages: Springer Book Archive