Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Fundamentals of Data Warehouses
Fundamentals of Data Warehouses
Database Management Systems
View selection for designing the global data warehouse
Data & Knowledge Engineering - Data warehousing
A formal perspective on the view selection problem
The VLDB Journal — The International Journal on Very Large Data Bases
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Efficient exploitation of similar subexpressions for query processing
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Scalable semantic web data management using vertical partitioning
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
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
Scalable join processing on very large RDF graphs
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Journal on data semantics VIII
RDFViewS: a storage tuning wizard for RDF applications
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
x-RDF-3X: fast querying, high update rates, and consistency for RDF databases
Proceedings of the VLDB Endowment
Selecting materialized views for RDF data
ICWE'10 Proceedings of the 10th international conference on Current trends in web engineering
Journal of Computer and System Sciences
Rewriting queries on SPARQL views
Proceedings of the 20th international conference on World wide web
Characteristic sets: Accurate cardinality estimation for RDF queries with multiple joins
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Optimizing query shortcuts in RDF databases
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
Getting more RDF support from relational databases
Proceedings of the 21st international conference companion on World Wide Web
A survey of view selection methods
ACM SIGMOD Record
SPARQL-RW: transparent query access over mapped RDF data sources
Proceedings of the 15th International Conference on Extending Database Technology
DataBridges: data integration for digital cities
Proceedings of the 2012 ACM workshop on City data management workshop
RDF pattern matching using sortable views
Proceedings of the 21st ACM international conference on Information and knowledge management
Efficient query answering against dynamic RDF databases
Proceedings of the 16th International Conference on Extending Database Technology
Colledge: a vision of collaborative knowledge networks
Proceedings of the 2nd International Workshop on Semantic Search over the Web
Towards performance evaluation of semantic databases management systems
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Growing triples on trees: an XML-RDF hybrid model for annotated documents
The VLDB Journal — The International Journal on Very Large Data Bases
RDF analytics: lenses over semantic graphs
Proceedings of the 23rd international conference on World wide web
Hi-index | 0.00 |
We consider the setting of a Semantic Web database, containing both explicit data encoded in RDF triples, and implicit data, implied by the RDF semantics. Based on a query workload, we address the problem of selecting a set of views to be materialized in the database, minimizing a combination of query processing, view storage, and view maintenance costs. Starting from an existing relational view selection method, we devise new algorithms for recommending view sets, and show that they scale significantly beyond the existing relational ones when adapted to the RDF context. To account for implicit triples in query answers, we propose a novel RDF query reformulation algorithm and an innovative way of incorporating it into view selection in order to avoid a combinatorial explosion in the complexity of the selection process. The interest of our techniques is demonstrated through a set of experiments.