Distributed multi-source regular path queries

Show simple item record

dc.contributor.author Shoaran, Maryam
dc.date.accessioned 2010-04-06T21:38:40Z
dc.date.available 2010-04-06T21:38:40Z
dc.date.copyright 2007 en
dc.date.issued 2010-04-06T21:38:40Z
dc.identifier.uri http://hdl.handle.net/1828/2471
dc.description.abstract Regular path queries are the building block of almost any mechanism for querying semistructured data. Despite the fact that the main applications of such data are distributed, there are only few works dealing with distributed evaluation of regular path queries. In this thesis we present a message-efficient and truly distributed algorithm for computing the answer to regular path queries in a multi-source semistructured database setting. Our algorithm has several desirable properties. First, it is general as it works for the larger class of weighted regular path queries on weighted semistructured databases. Second, it performs a progressive evaluation, that is, partial answers can be represented to the user as soon as they are computed while she is waiting for new answers to arrive. Third, the proposed algorithm is symmetric among processes, i.e., they all run the same algorithm. And finally, it does not need a separate termination detection algorithm as it can detect the global termination simply by using an spanning tree. en
dc.language English eng
dc.language.iso en en
dc.rights Available to the World Wide Web en
dc.subject Regular path queries en
dc.subject Algorithms en
dc.subject Databases en
dc.subject.lcsh UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science en
dc.title Distributed multi-source regular path queries en
dc.type Thesis en
dc.contributor.supervisor Thomo, Alex
dc.degree.department Dept. of Computer Science en
dc.degree.level Master of Science M.Sc. en

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UVicSpace


My Account