A qualitative comparison study of data structures for large line segment databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
On the analysis of indexing schemes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Common expression analysis in database applications
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Optimizing Queries with Materialized Views
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Demand-Driven Caching in Multiuser Environment
IEEE Transactions on Knowledge and Data Engineering
AutoPart: Automating Schema Design for Large Scientific Databases Using Data Partitioning
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
The complexity of mining maximal frequent itemsets and maximal frequent patterns
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Algorithm Design
A path-based relational RDF database
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
C-store: a column-oriented DBMS
VLDB '05 Proceedings of the 31st international conference on Very large data bases
An efficient SQL-based RDF querying scheme
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Approximate frequency counts over data streams
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Self-tuning database systems: a decade of progress
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Effective and efficient semantic web data management over DB2
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
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
Caching of intermediate results in DHT-based RDF stores
International Journal of Metadata, Semantics and Ontologies
SW-Store: a vertically partitioned DBMS for Semantic Web data management
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient Indices Using Graph Partitioning in RDF Triple Stores
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Query Rewrites with Views for XML in DB2
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Scalable join processing on very large RDF graphs
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Reasoning Web. Semantic Technologies for Information Systems
Scalable indexing of RDF graphs for efficient join processing
Proceedings of the 18th ACM conference on Information and knowledge management
Semantic Web Information Management: A Model-Based Perspective
Semantic Web Information Management: A Model-Based Perspective
The RDF-3X engine for scalable management of RDF data
The VLDB Journal — The International Journal on Very Large Data Bases
Open user schema guided evaluation of streaming RDF queries
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
HStar – a semantic repository for large scale OWL documents
ASWC'06 Proceedings of the First Asian conference on The Semantic Web
Hi-index | 0.00 |
Performance and scalability are two issues that are becoming increasingly pressing as the resource description framework (RDF) datamodel is applied to real-world applications. Because neither vertical nor flat structures of RDF storage can handle frequent schema updates and meanwhile avoid possible long-chain joins, there is no clear winner between the two typical structures. In this paper, we propose an alternative open user schema. The open user schema consists of flat tables automatically extracted from RDF query streams. A query is divided into two parts and conquered on the flat tables in the open user schema and on the vertical table stored in a backend storage. At the core of this divide and conquer architecture with open user schema, an efficient isomorphic decision algorithm is introduced to guide a query to related flat tables in the open user schema. Our proposal in essence departs from existing methods in that it can accommodate schema updates without possible long-chain joins. We implement our approach and provide empirical evaluations to demonstrate both the efficiency and effectiveness of our approach in evaluating complex RDF queries.