Principles of database query processing for advanced applications
Principles of database query processing for advanced applications
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
EDUTELLA: a P2P networking infrastructure based on RDF
Proceedings of the 11th international conference on World Wide Web
Proceedings of the 17th International Conference on Data Engineering
Approximate String Joins in a Database (Almost) for Free
Proceedings of the 27th International Conference on Very Large Data Bases
Three Implementations of SquishQL, a Simple RDF Query Language
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
PeerDB: peering into personal databases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
BestPeer: A Self-Configurable Peer-to-Peer System
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
P-Grid: a self-organizing structured P2P system
ACM SIGMOD Record
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
PlanetLab: an overlay testbed for broad-coverage services
ACM SIGCOMM Computer Communication Review
A Peer-to-peer Framework for Caching Range Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Index structures and algorithms for querying distributed RDF repositories
Proceedings of the 13th international conference on World Wide Web
The Practical Handbook of Internet Computing
The Practical Handbook of Internet Computing
Load balancing and locality in range-queriable data structures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
"One Size Fits All": An Idea Whose Time Has Come and Gone
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
BATON: a balanced tree structure for peer-to-peer networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Indexing data-oriented overlay networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Peer-to-peer management of XML data: issues and research challenges
ACM SIGMOD Record
The Essence of P2P: A Reference Architecture for Overlay Networks
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Range Queries in Trie-Structured Overlays
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Optimized Index Structures for Querying RDF from the Web
LA-WEB '05 Proceedings of the Third Latin American Web Congress
VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Scalable p2p based RDF querying
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Querying the internet with PIER
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Contention-based performance evaluation of multidimensional range search in peer-to-peer networks
Future Generation Computer Systems
RDF-3X: a RISC-style engine for RDF
Proceedings of the VLDB Endowment
Estimating the number of answers with guarantees for structured queries in p2p databases
Proceedings of the 17th ACM conference on Information and knowledge management
Approximating query completeness by predicting the number of answers in DHT-based web applications
Proceedings of the 10th ACM workshop on Web information and data management
Query Planning in DHT Based RDF Stores
SITIS '08 Proceedings of the 2008 IEEE International Conference on Signal Image Technology and Internet Based Systems
Skyframe: a framework for skyline query processing in peer-to-peer systems
The VLDB Journal — The International Journal on Very Large Data Bases
Cost-Aware Skyline Queries in Structured Overlays
ICDEW '07 Proceedings of the 2007 IEEE 23rd International Conference on Data Engineering Workshop
Scalable join processing on very large RDF graphs
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Semantics and complexity of SPARQL
ACM Transactions on Database Systems (TODS)
Towards Parallel Processing of RDF Queries in DHTs
Globe '09 Proceedings of the 2nd International Conference on Data Management in Grid and Peer-to-Peer Systems
A subscribable peer-to-peer RDF repository for distributed metadata management
Web Semantics: Science, Services and Agents on the World Wide Web
Data summaries for on-demand queries over linked data
Proceedings of the 19th international conference on World wide web
Querying distributed RDF data sources with SPARQL
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Atlas: Storing, updating and querying RDF(S) data on top of DHTs
Web Semantics: Science, Services and Agents on the World Wide Web
German-lab experimental facility
FIS'10 Proceedings of the Third future internet conference on Future internet
SPARQL beyond subgraph matching
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
SPARQL query optimization on top of DHTs
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Evaluating conjunctive triple pattern queries over large structured overlay networks
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Top k RDF query evaluation in structured P2P networks
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Efficient range queries and fast lookup services for scalable p2p networks
DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
Hi-index | 0.00 |
Linked Data is becoming the core part of modern Web applications and thus efficient access to structured information expressed in RDF gains paramount importance. A number of efficient local RDF stores exist already, while distributed indexing and distributed query processing over Linked Data with similar efficiency and data management features as known from traditional database and data integration systems are only starting to develop. Distributed approaches will necessarily co-exist with centralized schemes, as data will be owned by different stakeholders who may not want to provide their complete data sets to a central place. Additionally, central/integrated storage may be prohibited for organizational or legal reasons in certain areas. To support decentralized schemes, only a few attempts in this direction exist so far, but they are limited in terms of capabilities and the degree of distribution vs. efficiency, query expressivity, and scalability. To remedy this situation, the approach and proof-of-concept prototype presented in this paper provides a solution for these open challenges. As we argue for widely distributed systems as a possible answer to scalability issues, we first identify and discuss the main challenges and based on this analysis, we propose an approach for efficient and scalable query processing over distributed Linked Data sources, taking into account the latest advances in database technology. Our system is based on a layered architecture that makes use of the advantages of decentralized indexing and query processing approaches, which have been researched and matured over the last decade. Our approach is based on a logical algebra for queries over RDF data and a related physical query algebra to enable optimization, both on the logical and physical layers in query processing. The introduced operators and strategies for processing complex query plans make excessive use of parallelism and other optimization paradigms of distributed query processing. Our query processing framework includes a sophisticated cost model to enable cost-efficient query planning and query execution. We extensively evaluate our approach through an experimental evaluation of a real proof-of-concept deployment, which demonstrates the efficiency, applicability, and correctness of the proposed concepts.