Linked Data Explorerhttp://worldcat.org/entity/work/id/198961171
A graph based cache system for efficient querying in distributed triplestores
In this dissertation, we develop a distributed triplestore while investigating different approaches for improving the efficiency of query processing. We implement several index structures at a Mediator where each index structure helps to minimize unproductive communications. We show how the addition of each index structure reduces the query response time. We make use of graph-based caches at the Mediator and at individual triplestores to store triples that correspond to the most frequent set of queries. The Mediator cache enables the Mediator to respond to certain queries, while the triplestore caches avoid the need to perform joins between partial results from different triplestores. Sub-graph isomorphism is used to determine whether a cache has sufficient triples to answer a given query. We show how these caches significantly improve querying efficiency.
Open All Close All
http://schema.org/description
- "In this dissertation, we develop a distributed triplestore while investigating different approaches for improving the efficiency of query processing. We implement several index structures at a Mediator where each index structure helps to minimize unproductive communications. We show how the addition of each index structure reduces the query response time. We make use of graph-based caches at the Mediator and at individual triplestores to store triples that correspond to the most frequent set of queries. The Mediator cache enables the Mediator to respond to certain queries, while the triplestore caches avoid the need to perform joins between partial results from different triplestores. Sub-graph isomorphism is used to determine whether a cache has sufficient triples to answer a given query. We show how these caches significantly improve querying efficiency."@en
- "Predefining structures for data preclude the ability to describe certain details effectively, as data is dynamically structured by nature and can be highly diverse and multifaceted. Conventional datastores, such as relational databases, do not conveniently accommodate dynamically varying structures, as frequently modifying database schemas is not feasible. Although, XML databases have been proposed as suitable for such dynamic structured data, these databases suffer from update anomalies. RDF triplestores offer a flexible solution for handling such data, where any property about an entity can be described by a triple consisting of a subject, a predicate, and an object. Data is inherently distributed due to origination points, ownership, and many other reasons."@en
http://schema.org/name
- "A graph based cache system for efficient querying in distributed triplestores"@en