Query size estimation by adaptive sampling (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Scalable semantic web data management using vertical partitioning
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Experimenting with recursive queries in database and logic programming systems
Theory and Practice of Logic Programming
SPARQL basic graph pattern optimization using selectivity estimation
Proceedings of the 17th international conference on World Wide Web
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
SW-Store: a vertically partitioned DBMS for Semantic Web data management
The VLDB Journal — The International Journal on Very Large Data Bases
Scalable join processing on very large RDF graphs
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
RDFKB: efficient support for RDF inference queries and knowledge management
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Scalable indexing of RDF graphs for efficient join processing
Proceedings of the 18th ACM conference on Information and knowledge management
Dynamic Querying of Mass-Storage RDF Data with Rule-Based Entailment Regimes
ISWC '09 Proceedings of the 8th International Semantic Web Conference
YARS2: a federated repository for querying graph structured data from the web
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
An optimised semantic web query language implementation in prolog
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Semantics and complexity of SPARQL
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
SPARQL query optimization on top of DHTs
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Parallelizing join computations of SPARQL queries for large semantic web databases
Proceedings of the 2011 ACM Symposium on Applied Computing
What are real SPARQL queries like?
Proceedings of the International Workshop on Semantic Web Information Management
An intermediate algebra for optimizing RDF graph pattern matching on MapReduce
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
ANAPSID: an adaptive query processing engine for SPARQL endpoints
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
To cache or not to cache: the effects of warming cache in complex SPARQL queries
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part II
Accelerating large semantic web databases by parallel join computations of SPARQL queries
ACM SIGAPP Applied Computing Review
Heuristics-based query optimisation for SPARQL
Proceedings of the 15th International Conference on Extending Database Technology
A linear algebra technique for (de)centralized processing of SPARQL queries
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
Scalable RDF graph querying using cloud computing
Journal of Web Engineering
Hi-index | 0.00 |
In SPARQL, conjunctive queries are expressed by using shared variables across sets of triple patterns, also called basic graph patterns. Based on this characterization, basic graph patterns in a SPARQL query can be partitioned into groups of acyclic patterns that share exactly one variable, or star-shaped groups. We observe that the number of triples in a group is proportional to the number of individuals that play the role of the subject or the object; however, depending on the degree of participation of the subject individuals in the properties, a group could be not much larger than a class or type to which the subject or object belongs. Thus, it may be significantly more efficient to independently evaluate each of the groups, and then merge the resulting sets, than linearly joining all triples in a basic graph pattern. Based on this observation, we have developed query optimization and evaluation techniques on star-shaped groups. We have conducted an empirical analysis on the benefits of the optimization and evaluation techniques in several SPARQL query engines. We observe that our proposed techniques are able to speed up query evaluation time for join queries with star-shaped patterns by at least one order of magnitude.