Abstract
We present an access method for set-valued attributes that is based on a multi-level extendible hashing scheme. This scheme avoids exponential directory growth for skewed data and thus generates a much smaller number of subqueries for query sets (so far fast-growing directories have prohibited hash-based index structures for set-valued retrieval). We demonstrate the advantages of our scheme over regular extendible hashing both analytically and experimentally. We also implemented a prototype and briefly summarize the results of our experimental evaluation.
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
Bertino, E., Kim, W.: Indexing techniques for queries on nested objects. IEEE Trans. on Knowledge and Data Engineering 1(2), 196–214 (1989)
Cattell, R. (ed.): The Object Database Standard: ODMG 2.0. Morgan Kaufmann, San Francisco (1997)
Deppisch, U.: S-tree: A dynamic balanced signature index for office retrieval. In: Proc. of the 1986 ACM Conf. on Research and Development in Information Retrieval, Pisa (1986)
Fagin, R., Nievergelt, J., Pippenger, N., Strong, H.R.: Extendible hashing – a fast access method for dynamic files. ACM Transactions on Database Systems 4(3), 315–344 (1979)
Faloutsos, C., Christodoulakis, S.: Signature files: An access method for documents and its analytical performance evaluation. ACM Transactions on Office Informations Systems 2(4), 267–288 (1984)
Grobel, T., Kilger, C., Rude, S.: Object-oriented modelling of production organization. In: Tagungsband der 22. GI-Jahrestagung, Karlsruhe, September 1992, Springer, Heidelberg (1992)
Hellerstein, J.M., Pfeffer, A.: The RD-tree: An index structure for sets. Technical Report 1252, University of Wisconsin at Madison (1994)
Helmer, S., Aly, R., Neumann, T., Moerkotte, G.: Indexing Set-Valued Attributes with a Multi-Level Extendible Hashing Scheme. Technical Report BBKCS-07-01, Birkbeck, University of London, http://www.dcs.bbk.ac.uk/research/techreps/2007/
Helmer, S., Neumann, T., Moerkotte, G.: A robust scheme for multilevel extendible hashing. Technical Report 19/01, Universität Mannheim (2001), http://pi3.informatik.uni-mannheim.de
Helmer, S., Neumann, T., Moerkotte, G.: A robust scheme for multilevel extendible hashing. In: Yazıcı, A., Şener, C. (eds.) ISCIS 2003. LNCS, vol. 2869, pp. 220–227. Springer, Heidelberg (2003)
Helmer, S., Moerkotte, G.: A performance study of four index structures for set-valued attributes of low cardinality. VLDB Journal 12(3), 244–261 (2003)
Ishikawa, Y., Kitagawa, H., Ohbo, N.: Evaluation of signature files as set access facilities in OODBs. In: Proc. of the 1993 ACM SIGMOD, Washington, pp. 247–256. ACM Press, New York (1993)
Kemper, A., Moerkotte, G.: Access support relations: An indexing method for object bases. Information Systems 17(2), 117–146 (1992)
Knuth, D.E.: The Art of Computer Programming. In: Sorting and Searching, Addison Wesley, Reading, Massachusetts (1973)
Larson, P.A.: Linear hashing with partial expansions. In: Proc. of the 6th VLDB Conference, Montreal, pp. 224–232 (1980)
Maier, D., Stein, J.: Indexing in an object-oriented database. In: Proc. of the IEEE Workshop on Object-Oriented DBMSs, Asilomar, California (September 1986)
Morzy, M., Morzy, T., Nanopoulos, A., Manolopoulos, Y.: Hierarchical bitmap index: An efficient and scalable indexing technique for set-valued attributes. In: Kalinichenko, L.A., Manthey, R., Thalheim, B., Wloka, U. (eds.) ADBIS 2003. LNCS, vol. 2798, pp. 236–252. Springer, Heidelberg (2003)
Stonebraker, M., Moore, D.: Object-Relational DBMSs: The Next Great Wave. Morgan Kaufmann, San Francisco (1996)
Tousidou, E., Bozanis, P., Manolopoulos, Y.: Signature-based structures for objects with set-valued attributes. Information Systems 27(2), 93–121 (2002)
Tousidou, E., Nanopoulos, A., Manolopoulos, Y.: Improved methods for signature-tree construction. The Computer Journal 43(4), 301–314 (2000)
Will, M., Fachinger, W., Richert, J.R.: Fully automated structure elucidation - a spectroscopist’s dream comes true. J. Chem. Inf. Comput. Sci. 36, 221–227 (1996)
Xie, Z., Han, J.: Join index hierarchies for supporting efficient navigation in object-oriented databases. In: Proc. Int. Conf. on Very Large Data Bases (VLDB), pp. 522–533 (1994)
Zobel, J., Moffat, A., Ramamohanarao, K.: Inverted files versus signature files for text indexing. Technical Report CITRI/TR-95-5, Collaborative Information Technology Research Institute (CITRI), Victoria, Australia (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Helmer, S., Aly, R., Neumann, T., Moerkotte, G. (2007). Indexing Set-Valued Attributes with a Multi-level Extendible Hashing Scheme. In: Wagner, R., Revell, N., Pernul, G. (eds) Database and Expert Systems Applications. DEXA 2007. Lecture Notes in Computer Science, vol 4653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74469-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-74469-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74467-2
Online ISBN: 978-3-540-74469-6
eBook Packages: Computer ScienceComputer Science (R0)