Supporting Incremental Join Queries on Ranked Inputs
Proceedings of the 27th International Conference on Very Large Data Bases
Supporting top-k join queries in relational databases
The VLDB Journal — The International Journal on Very Large Data Bases
RankSQL: query algebra and optimization for relational top-k queries
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Efficient top-k aggregation of ranked inputs
ACM Transactions on Database Systems (TODS)
Top-k query evaluation with probabilistic guarantees
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Robust and efficient algorithms for rank join evaluation
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Language-model-based ranking for queries on RDF-graphs
Proceedings of the 18th ACM conference on Information and knowledge management
Optimal algorithms for evaluating rank joins in database systems
ACM Transactions on Database Systems (TODS)
Using Naming Authority to Rank Data and Ontologies for Web Search
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Executing SPARQL Queries over the Web of Linked Data
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Data summaries for on-demand queries over linked data
Proceedings of the 19th international conference on World wide web
Proceedings of the VLDB Endowment
Linked data query processing strategies
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
SIHJoin: querying remote and local linked data
ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
Zero-knowledge query planning for an iterator implementation of link traversal based query execution
ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
Efficient execution of top-k SPARQL queries
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
Diversified top-k graph pattern matching
Proceedings of the VLDB Endowment
Efficiently Producing the K Nearest Neighbors in the Skyline on Vertically Partitioned Tables
International Journal of Information Retrieval Research
Hi-index | 0.00 |
In recent years, top-k query processing has attracted much attention in large-scale scenarios, where computing only the k "best" results is often sufficient. One line of research targets the so-called top-k join problem, where the k best final results are obtained through joining partial results. In this paper, we study the top-k join problem in a Linked Data setting, where partial results are located at different sources and can only be accessed via URI lookups. We show how existing work on top-k join processing can be adapted to the Linked Data setting. Further, we elaborate on strategies for a better estimation of scores of unprocessed join results (to obtain tighter bounds for early termination) and for an aggressive pruning of partial results. Based on experiments on real-world Linked Data, we show that the proposed top-k join processing technique substantially improves runtime performance.