Abstract

Internet search engines have popularized the keywordbased search paradigm. While traditional database management systems offer powerful query languages, they do not allow keyword-based search. In this paper, we discuss DBXplorer, a system that enables keywordbased search in relational databases. DBXplorer has been implemented using a commercial relational database and web server and allows users to interact via a browser front-end. We outline the challenges and discuss the implementation of our system including results of extensive experimental evaluation. 1.

Citations

2221	Authoritative Sources in a Hyperlinked Environment - Kleinberg - 1998
1927	Modern Information Retrieval - Baeza-Yates, Ribeiro-Neto - 1999
801	Depth-first search and linear graph algorithms - Tarjan - 1972
787	Human Behavior and the Principle of Least-Effort - Zipf - 1949
467	Querying semi-structured data - Abiteboul - 1997
33	Compression: A key for next-generation text retrieval systems - Ziviani, Moura, et al.
19	An algorithm for tree-query membership of a distributed query - Yu, Ozsoyoglu - 1979
16	On the universal relation - Graham - 1979
12	A simple algorithm for listing all trees of a graph - Minty - 1965
5	Integrating Keyword Search into - Florescu, Kossmann, et al. - 2000
5	An Algorithm for Enumerating All Spanning Trees of a Directed Graph. Algorithmica 27 - Kapoor, Ramesh - 2000
2	partitions - Feder, Hell, et al. - 1991
1	Building a Full Text Index for the Web, http://dbpubs - Melnik, Raghavan, et al. - 2000