Abstract
Google’s successful PageRank brings to the Web an order that well reflects the relative importance of Web pages. Inspired by PageRank, we propose a similar scheme called TupleRank for ranking tuples in a relational database. Database tuples naturally relate to each other through referential integrity constraints declared in the schema. However, such constraints cannot capture more general relationships such as similarity. Furthermore, relationships determined statically from the database schema do not reflect actual query patterns that arise at runtime. To address these deficiencies of static TupleRank, we introduce the notion of query-driven TupleRank. We develop techniques to compute query-driven TupleRank accurately and efficiently with low space requirement. We further augment query-driven TupleRank so that it can better utilize the access frequency information collected from the workload. Preliminary experiment results demonstrate that TupleRank is both informative and intuitive, and they confirm the advantages of query-driven TupleRank over static TupleRank.
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
Mondial, http://user.informatik.uni-goettingen.de/~may/Mondial
Bhalotia, G., Nakhe, C., Hulgeri, A., Chakrabarti, S., Sudarshan, S.: Keyword searching and browsing in databases using BANKS. In: Proc. of the 2002 Intl. Conf. on Data Engineering, San Jose, California (February 2002)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. In: Proc. of the 1998 Intl. World Wide Web Conf., Brisbane, Australia (April 1998)
Cain, H.W., Rajwar, R., Marden, M., Lipasti, M.H.: An architectural evaluation of Java TPC-W. In: Proc. of the 2001 Intl. Symp. on High-Performance Computer Architecture (January 2001)
Cui, Y., Widom, J.: Lineage tracing for general data warehouse transformations. In: Proc. of the 2001 Intl. Conf. on Very Large Data Bases, Roma, Italy, September 2001, pp. 471–480 (2001)
Dar, S., Entin, G., Geva, S., Palmon, E.: DTL’s DataSpot: Database exploration using plain language. In: Proc. of the 1998 Intl. Conf. on Very Large Data Bases, New York City, New York, August 1998, pp. 645–649 (1998)
Dongarra, J., Lumsdaine, A., Pozo, R., Remington, K.: A sparse matrix library in C++ for high performance architectures. In: Proc. of the Second Object-Oriented Numerics Conference, pp. 214–218 (1994)
Garcia-Molina, H., Ullman, J.D., Widom, J.: Database Systems: The Complete Book. Prentice Hall, Upper Saddle River (2002)
Goldman, R., Shivakumar, N., Venkatasubramanian, S., Garcia-Molina, H.: Proximity search in databases. In: Proc. of the 1998 Intl. Conf. on Very Large Data Bases, New York City, New York, August 1998, pp. 26–37 (1998)
Hristidis, V., Papakonstantinou, Y.: DISCOVER: Keyword search in relational databases. In: Proc. of the 2002 Intl. Conf. on Very Large Data Bases, Hong Kong, China, August 2002, pp. 670–681 (2002)
Huang, X., Xue, Q., Yang, J.: TupleRank and implicit relationship discovery in relational databases. Technical report, Duke University (March 2003), http://www.cs.duke.edu/~junyang/papers/hxy-tuplerank.ps
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the Web. Technical report, Stanford University (November 1999)
Transaction Processing Performance Council. TPC-W benchmark specification, http://www.tpc.org/wspec.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, X.(., Xue, Q., Yang, J. (2003). TupleRank and Implicit Relationship Discovery in Relational Databases. In: Dong, G., Tang, C., Wang, W. (eds) Advances in Web-Age Information Management. WAIM 2003. Lecture Notes in Computer Science, vol 2762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45160-0_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-45160-0_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40715-7
Online ISBN: 978-3-540-45160-0
eBook Packages: Springer Book Archive