Twig Pattern Search in XML Database

WinnSpace/Manakin Repository

Twig Pattern Search in XML Database

Show simple item record

dc.contributor.author Zou, Leping
dc.date.accessioned 2011-03-04T04:18:39Z
dc.date.available 2011-03-04T04:18:39Z
dc.date.issued 2011-03-03
dc.identifier.uri http://hdl.handle.net/10680/300
dc.description.abstract For current search engine, we got results ranked by popularity. However, the most popular topics are not always I want. Millions people have millions different favors. So, the main challenge is how to dig the information up from the tremendous database of Internet according to different people's favor. In computer science, "favor" is pattern. We call it "Twig Pattern Search". Unlike index methods that split a query into several sub-queries, and then stick the results together to provide the final answers, twig pattern search uses tree structures as the master unit of query to avoid expensive join operations. We present an efficient algorithm for tree mapping problem in XML database. Given a target tree T and a pattern tree Q, the algorithm can find all the embeddings of Q in T in O (|D||Q|) time, where D is the largest data stream associated with a node of Q. en_US
dc.language.iso en en_US
dc.subject Twig Pattern, XML Database, Thesis en_US
dc.title Twig Pattern Search in XML Database en_US
dc.type Thesis en_US
dc.type Thesis or Dissertation en_US

Files in this item

Files Size Format View Description
Thesis_Dec_Final.pdf 684.3Kb PDF View/Open Thesis

This item appears in the following Collection(s)

Show simple item record

Search WinnSpace


Advanced Search

Browse

My Account