The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Bibliography on domination in graphs and some basic definitions of domination parameters
Discrete Mathematics - Topics on domination
WordNet: a lexical database for English
Communications of the ACM
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Keyword Searching and Browsing in Databases using BANKS
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Group Nearest Neighbor Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 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
C-store: a column-oriented DBMS
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Effective keyword search in relational databases
Proceedings of the 2006 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
Query processing in spatial network databases
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
Scalable semantic web data management using vertical partitioning
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
YAGO: A Large Ontology from Wikipedia and WordNet
Web Semantics: Science, Services and Agents on the World Wide Web
RDF-3X: a RISC-style engine for RDF
Proceedings of the VLDB Endowment
Hexastore: sextuple indexing for semantic web data management
Proceedings of the VLDB Endowment
Column-store support for RDF data management: not all swans are white
Proceedings of the VLDB Endowment
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
Distributed top-k aggregation queries at large
Distributed and Parallel Databases
DBpedia - A crystallization point for the Web of Data
Web Semantics: Science, Services and Agents on the World Wide Web
LUBM: A benchmark for OWL knowledge base systems
Web Semantics: Science, Services and Agents on the World Wide Web
Matrix "Bit" loaded: a scalable lightweight join query processor for RDF data
Proceedings of the 19th international conference on World wide web
Nearest keyword search in XML documents
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Index structures and top-k join algorithms for native keyword search databases
Proceedings of the 20th ACM international conference on Information and knowledge management
Querying RDF data from a graph database perspective
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Hi-index | 0.00 |
Resource Description Framework (RDF) has been widely used as a W3C standard to describe the resource information in the Semantic Web. A standard SPARQL query over RDF data requires query issuers to fully understand the domain knowledge of the data. Because of this fact, SPARQL queries over RDF data are not flexible and it is difficult for non-experts to create queries without knowing the underlying data domain. Inspired by this problem, in this paper, we propose and tackle a novel and important query type, namely k-nearest keyword (k-NK) query, over a large RDF graph. Specifically, a k-NK query obtains k closest pairs of vertices, (v"i,u"i), in the RDF graph, that contain two given keywords q and w, respectively, such that u"i is the nearest vertex of v"i that contains the keyword w. To efficiently answer k-NK queries, we design effective pruning methods for RDF graphs both with and without schema, which can greatly reduce the query search space. Moreover, to facilitate our pruning strategies, we propose effective indexing mechanisms on RDF graphs with/without schema to enable fast k-NK query answering. Through extensive experiments, we demonstrate the efficiency and effectiveness of our proposed k-NK query processing approaches.