Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Fuzzy queries in multimedia database systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Authoritative sources in a hyperlinked environment
Journal of the ACM (JACM)
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A polylogarithmic approximation algorithm for the group Steiner tree problem
Journal of Algorithms
SALSA: the stochastic approach for link-structure analysis
ACM Transactions on Information Systems (TOIS)
XRANK: ranked keyword search over XML documents
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
DBXplorer: A System for Keyword-Based Search over Relational Databases
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Keyword Searching and Browsing in Databases using BANKS
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Supporting top-k join queries in relational databases
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient keyword search for smallest LCAs in XML databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Bidirectional expansion for keyword search on graph databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Keyword Proximity Search in XML Trees
IEEE Transactions on Knowledge and Data Engineering
Finding and approximating top-k answers in keyword proximity search
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Effective keyword search in relational databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Dynamic personalized pagerank in entity-relation graphs
Proceedings of the 16th international conference on World Wide Web
Multiway SLCA-based keyword search in XML data
Proceedings of the 16th international conference on World Wide Web
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Spark: top-k keyword query in relational databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Effective keyword-based selection of relational databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
BLINKS: ranked keyword searches on graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Identifying meaningful return information for XML keyword search
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Keyword search on relational data streams
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Discover: keyword search in relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
XSEarch: a semantic search engine for XML
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient IR-style keyword search over relational databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Objectrank: authority-based keyword search in databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Effective keyword search for valuable lcas over xml documents
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Précis: from unstructured keywords as queries to structured databases as answers
The VLDB Journal — The International Journal on Very Large Data Bases
TopX: efficient and versatile top-k query processing for semistructured data
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient keyword search over virtual XML views
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient LCA based keyword search in XML data
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Race: finding and ranking compact connected trees for keyword proximity search over xml documents
Proceedings of the 17th international conference on World Wide Web
Sailer: an effective search engine for unified retrieval of heterogeneous xml and web documents
Proceedings of the 17th international conference on World Wide Web
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A graph method for keyword-based selection of the top-K databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Keyword proximity search in complex data graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Reasoning and identifying relevant matches for XML keyword search
Proceedings of the VLDB Endowment
Keyword search on external memory data graphs
Proceedings of the VLDB Endowment
DB&IR integration: report on the Dagstuhl seminar
ACM SIGMOD Record
Data clouds: summarizing keyword search results over structured data
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Retrieving meaningful relaxed tightest fragments for XML keyword search
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Finding frequent co-occurring terms in relational keyword search
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficient interactive fuzzy keyword search
Proceedings of the 18th international conference on World wide web
Anytime measures for top-k algorithms on exact and fuzzy data sets
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient keyword search over virtual XML views
The VLDB Journal — The International Journal on Very Large Data Bases
Keyword Search on Spatial Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Progressive Keyword Search in Relational Databases
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Effective XML Keyword Search with Relevance Oriented Ranking
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Keyword Search in Spatial Databases: Towards Searching by Document
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Top-k typicality queries and efficient query answering methods on large databases
The VLDB Journal — The International Journal on Very Large Data Bases
Combining keyword search and forms for ad hoc querying of databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Keyword search in databases: the power of RDBMS
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Efficient type-ahead search on relational data: a TASTIER approach
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Keyword search on structured and semi-structured data
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
SAIL: Structure-aware indexing for effective and progressive top-k keyword search over XML documents
Information Sciences: an International Journal
Efficient fuzzy full-text type-ahead search
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs transformed from relational data. These methods, however, are rather expensive as the minimum Steiner tree problem is known to be NP-hard. Further, these methods are independent of the underlying relational database management system (RDBMS), thus cannot benefit from the capabilities of the RDBMS. As an alternative, in this paper we propose a new concept called Compact Steiner Tree (CSTree), which can be used to approximate the Steiner tree problem for answering top-k keyword queries efficiently. We propose a novel structure-aware index, together with an effective ranking mechanism for fast, progressive and accurate retrieval of top-k highest ranked CSTrees. The proposed techniques can be implemented using a standard relational RDBMS to benefit from its indexing and query-processing capability. We have implemented our techniques in MYSQL, which can provide built-in keyword-search capabilities using SQL. The experimental results show a significant improvement in both search efficiency and result quality comparing to existing state-of-the-art approaches.