On generating all maximal independent sets
Information Processing Letters
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Approximation algorithms for directed Steiner problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
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
Retrieving and organizing web pages by “information unit”
Proceedings of the 10th international conference on World Wide Web
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
DBXplorer: enabling keyword search over relational databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Keyword Searching and Browsing in Databases using BANKS
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Bidirectional expansion for keyword search on graph databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Efficiently enumerating results of keyword search
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
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
Best position algorithms for top-k queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficiently enumerating results of keyword search over data graphs
Information Systems
Keyword proximity search in complex data graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Learning to create data-integrating queries
Proceedings of the VLDB Endowment
ER '08 Proceedings of the 27th International Conference on Conceptual Modeling
Answering aggregate keyword queries on relational databases using minimal group-bys
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
Keyword search in databases: the power of RDBMS
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
Keyword search over relational tables and streams
ACM Transactions on Database Systems (TODS)
SAIL: Structure-aware indexing for effective and progressive top-k keyword search over XML documents
Information Sciences: an International Journal
From keywords to semantic queries-Incremental query construction on the semantic web
Web Semantics: Science, Services and Agents on the World Wide Web
Structured search result differentiation
Proceedings of the VLDB Endowment
Cluster-Based Exploration for Effective Keyword Search over Semantic Datasets
ER '09 Proceedings of the 28th International Conference on Conceptual Modeling
Efficient keyword search over data-centric XML documents
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Understanding queries in a search database system
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Exploratory keyword search on data graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Discover hierarchical subgraphs with network-topology based ranking score
Proceedings of the Third C* Conference on Computer Science and Software Engineering
Exploit keyword query semantics and structure of data for effective XML keyword search
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
Breaking out of the box of recommendations: from items to packages
Proceedings of the fourth ACM conference on Recommender systems
Ten thousand SQLs: parallel keyword queries computing
Proceedings of the VLDB Endowment
Using structural information in XML keyword search effectively
ACM Transactions on Database Systems (TODS)
Scalable keyword search on large data streams
The VLDB Journal — The International Journal on Very Large Data Bases
Providing built-in keyword search capabilities in RDBMS
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the 20th international conference companion on World wide web
Best position algorithms for efficient top-k query processing
Information Systems
Finding a minimal tree pattern under neighborhood constraints
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Nearest keyword search in XML documents
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient approximate top-k query algorithm using cube index
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
A path-oriented RDF index for keyword search query processing
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Processing keyword search on XML: a survey
World Wide Web
Combining incompleteness and ranking in tree queries
ICDT'07 Proceedings of the 11th international conference on Database Theory
Retrieving keyworded subgraphs with graph ranking score
Expert Systems with Applications: An International Journal
iSearch: an interpretation based framework for keyword search in relational databases
KEYS '12 Proceedings of the Third International Workshop on Keyword Search on Structured Data
Proceedings of the VLDB Endowment
Ranking the answer trees of graph search by both structure and content
Proceedings of the 1st Joint International Workshop on Entity-Oriented and Semantic Search
A distributed index for efficient parallel top-k keyword search on massive graphs
Proceedings of the twelfth international workshop on Web information and data management
Processing top-k queries in distributed hash tables
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
A personal perspective on keyword search over data graphs
Proceedings of the 16th International Conference on Database Theory
Certain and possible XPath answers
Proceedings of the 16th International Conference on Database Theory
Extracting minimum-weight tree patterns from a schema with neighborhood constraints
Proceedings of the 16th International Conference on Database Theory
Towards query model integration: topology-aware, IR-inspired metrics for declarative graph querying
Proceedings of the Joint EDBT/ICDT 2013 Workshops
The complexity of mining maximal frequent subgraphs
Proceedings of the 32nd symposium on Principles of database systems
Top-k queries over web applications
The VLDB Journal — The International Journal on Very Large Data Bases
Answering Top-k Keyword Queries on Relational Databases
International Journal of Information Retrieval Research
Hi-index | 0.00 |
Various approaches for keyword proximity search have been implemented in relational databases, XML and the Web. Yet, in all of them, an answer is a Q-fragment, namely, a subtree T of the given data graph G, such that T contains all the keywords of the query Q and has no proper subtree with this property. The rank of an answer is inversely proportional to its weight. Three problems are of interest: finding an optimal (i.e., top-ranked) answer, computing the top-k answers and enumerating all the answers in ranked order. It is shown that, under data complexity, an efficient algorithm for solving the first problem is sufficient for solving the other two problems with polynomial delay. Similarly, an efficient algorithm for finding a θ-approximation of the optimal answer suffices for carrying out the following two tasks with polynomial delay, under query-and-data complexity. First, enumerating in a (θ+1)-approximate order. Second, computing a (θ+1)-approximation of the top-k answers. As a corollary, this paper gives the first efficient algorithms, under data complexity, for enumerating all the answers in ranked order and for computing the top-k answers. It also gives the first efficient algorithms, under query-and-data complexity, for enumerating in a provably approximate order and for computing an approximation of the top-k answers.