skip to content
A graph based cache system for efficient querying in distributed triplestores Preview this item
ClosePreview this item
Checking...

A graph based cache system for efficient querying in distributed triplestores

Author: Tharaka Devadithya; Indiana University, Bloomington.
Publisher: [Bloomington, Ind.] : Indiana University, 2008.
Dissertation: Ph. D. Indiana University, Dept. of Computer Science 2008
Edition/Format:   Thesis/dissertation : Document : Thesis/dissertation : eBook   Computer File : English
Publication:Dissertation Abstracts International, 69-08B.
Database:WorldCat
Summary:
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
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Document, Thesis/dissertation, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Tharaka Devadithya; Indiana University, Bloomington.
ISBN: 9780549759089 0549759085
OCLC Number: 320951070
Notes: Title from PDF title page (viewed on May 14, 2009).
Source: Dissertation Abstracts International, Volume: 69-08, Section: B, page: 4837.
Adviser: Randall Bramley.
Description: 186 pages : digital, PDF file
Details: Mode of access: World Wide Web.
Responsibility: Tharaka Devadithya.

Abstract:

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.

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.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/320951070> # A graph based cache system for efficient querying in distributed triplestores
    a schema:Book, pto:Web_document, schema:MediaObject, schema:CreativeWork, bgn:Thesis ;
   bgn:inSupportOf "" ;
   library:oclcnum "320951070" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/inu> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/198961171#Place/bloomington_ind> ; # Bloomington, Ind.
   schema:about <http://id.worldcat.org/fast/872451> ; # Computer science
   schema:contributor <http://viaf.org/viaf/140720861> ; # Indiana University, Bloomington.
   schema:creator <http://experiment.worldcat.org/entity/work/data/198961171#Person/devadithya_tharaka> ; # Tharaka Devadithya
   schema:datePublished "2008" ;
   schema: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 ;
   schema:description "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 ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/198961171> ;
   schema:inLanguage "en" ;
   schema:name "A graph based cache system for efficient querying in distributed triplestores"@en ;
   schema:productID "320951070" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/320951070#PublicationEvent/bloomington_ind_indiana_university_2008> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/198961171#Agent/indiana_university> ; # Indiana University
   schema:url <http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3324608> ;
   schema:workExample <http://worldcat.org/isbn/9780549759089> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/320951070> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/198961171#Agent/indiana_university> # Indiana University
    a bgn:Agent ;
   schema:name "Indiana University" ;
    .

<http://experiment.worldcat.org/entity/work/data/198961171#Person/devadithya_tharaka> # Tharaka Devadithya
    a schema:Person ;
   schema:familyName "Devadithya" ;
   schema:givenName "Tharaka" ;
   schema:name "Tharaka Devadithya" ;
    .

<http://experiment.worldcat.org/entity/work/data/198961171#Place/bloomington_ind> # Bloomington, Ind.
    a schema:Place ;
   schema:name "Bloomington, Ind." ;
    .

<http://id.worldcat.org/fast/872451> # Computer science
    a schema:Intangible ;
   schema:name "Computer science"@en ;
    .

<http://viaf.org/viaf/140720861> # Indiana University, Bloomington.
    a schema:Organization ;
   schema:name "Indiana University, Bloomington." ;
    .

<http://worldcat.org/isbn/9780549759089>
    a schema:ProductModel ;
   schema:isbn "0549759085" ;
   schema:isbn "9780549759089" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.