The difficulty of optimum index selection
ACM Transactions on Database Systems (TODS)
Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design
IEEE Transactions on Knowledge and Data Engineering
Automated Selection of Materialized Views and Indexes in SQL Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Graph indexing based on discriminative frequent structure analysis
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
The SPARQL Query Graph Model for Query Optimization
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
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
Efficient processing of SPARQL joins in memory by dynamically restricting triple patterns
Proceedings of the 2009 ACM symposium on Applied Computing
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Simplifying access to large-scale health care and life sciences datasets
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
View selection in Semantic Web databases
Proceedings of the VLDB Endowment
A survey of view selection methods
ACM SIGMOD Record
RDF pattern matching using sortable views
Proceedings of the 21st ACM international conference on Information and knowledge management
| Hi-index | 0.00 |
In the design of a relational database, the administrator has to decide, given a fixed or estimated workload, which indexes should be created. This so called index selection problem is an non-trivial optimization problem in relational databases. In this paper we describe a novel approach for index selection on RDF data sets. We propose an algorithm to automatically suggest a set of indexes as materialized views based on a workload of SPARQL queries. The selected set of indexes aims to decrease the cost of the workload. We provide a cost model to estimate the potential impact of candidate indexes on query performance and an algorithm to select an optimal set of indexes. This algorithm may be integrated into an existing SPARQL query engine. We experimentally evaluate our approach on a standard query processor. We claim that our approach is the first comprehensive suggestion for the index selection problem in RDF.