MIT 6 830 - Hexastore: Sextuple Indexing for Semantic Web Data Management (12 pages)

Previewing pages 1, 2, 3, 4 of 12 page document View the full content.
View Full Document

Hexastore: Sextuple Indexing for Semantic Web Data Management



Previewing pages 1, 2, 3, 4 of actual document.

View the full content.
View Full Document
View Full Document

Hexastore: Sextuple Indexing for Semantic Web Data Management

153 views


Pages:
12
School:
Massachusetts Institute of Technology
Course:
6 830 - Database Systems

Unformatted text preview:

Hexastore Sextuple Indexing for Semantic Web Data Management Cathrin Weiss Panagiotis Karras Abraham Bernstein Department of Informatics University of Zurich CH 8050 Zurich Switzerland lastname ifi uzh ch School of Computing National University of Singapore 117543 Singapore lastname comp nus edu sg Department of Informatics University of Zurich CH 8050 Zurich Switzerland lastname ifi uzh ch ABSTRACT statements called triples of the form hs p oi where s is a subject p is a predicate and o is an object each triple states the relation between the subject and the object A collection of triples can be represented as a directed typed graph with nodes representing subjects and objects and edges representing predicates connecting subject nodes to object nodes The increasing amount of RDF data on the Web calls for the development of systems customized for the efficient and effective management of such data Thus significant efforts have been dedicated to the development of architectures for storing and querying RDF data called triple stores 8 9 11 17 25 26 46 19 45 39 44 Still most existing triple stores suffer from either a scalability defect or a specialization of their architecture for special type queries or both Traditional approaches have either been limited to a memory based storage or mapped the triple based format to a relational data base therewith they have forgone the opportunity to optimize triple storage retrieval and updates to the graph based format In particular RDF triples were traditionally stored in a giant triples table causing serious scalability problems Other approaches tried to attenuate these problems by constructing relational like tables that gathered many properties together as attributes Still this approach did not escape the scalability defects The most recent effort towards alleviating these deficiencies 5 focused on taming the scalability drawback following a vertical partitioning approach In this approach a triples table i e a relational



View Full Document

Access the best Study Guides, Lecture Notes and Practice Exams

Loading Unlocking...
Login

Join to view Hexastore: Sextuple Indexing for Semantic Web Data Management and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Hexastore: Sextuple Indexing for Semantic Web Data Management and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?