An efficient algorithm for joining large XML documents

dc.contributor.advisorWang, F.
dc.contributor.authorZhou, Wei
dc.date.accessioned2021-03-31T15:37:33Z
dc.date.available2021-03-31T15:37:33Z
dc.date.copyright2003
dc.degree.departmentDepartment of Computing and Information Scienceen_US
dc.degree.grantorUniversity of Guelphen_US
dc.degree.nameMaster of Scienceen_US
dc.description.abstractXML is becoming the major markup language in developing heterogeneous distributed databases. Data from different sources can be encoded as XML documents and processed together. Join is one of the most important database operations for processing data together. XML documents have special features that make them different from relational data. Most join techniques developed for relational databases cannot be directly adopted for processing XML data. Efficient join algorithms are needed for building high performance XML databases. This thesis describes an efficient algorithm for joining large XML documents. This algorithm scans the data only one or two times. It creates a set of supporting structures then performs join in main memory or by direct disk access. It does not require any existing index structures, and is not dependent on the support from database software (e.g. an RDBMS).en_US
dc.identifier.urihttps://hdl.handle.net/10214/24302
dc.language.isoen
dc.publisherUniversity of Guelphen_US
dc.rights.licenseAll items in the Atrium are protected by copyright with all rights reserved unless otherwise indicated.
dc.subjectXMLen_US
dc.subjectmarkup languageen_US
dc.subjectheterogeneous distributed databasesen_US
dc.subjectjoin algorithmsen_US
dc.subjectXML databasesen_US
dc.titleAn efficient algorithm for joining large XML documentsen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Zhou_Wei_MSc.pdf
Size:
5.1 MB
Format:
Adobe Portable Document Format