Top K Query Processing In Distributed Database

ResearchCommons/Manakin Repository

Top K Query Processing In Distributed Database

Show simple item record Tamrakar, Amrita en_US 2007-09-19T21:53:12Z 2007-09-19T21:53:12Z 2007-09-19T21:53:12Z August 2007 en_US
dc.identifier.other DISS-1809 en_US
dc.description.abstract Today's data is rarely stored in centralized location due to the enormous amount of information that needs to be stored and also to increase reliability, availability and performance of the system. Same data is stored in different format into different company's database as well as they may be partitioned or replicated. We consider various scenarios of distributed database such as horizontal, vertical fragmentation and attribute overlapping. Allowing access to integrated information from these multiple datasets can provide accurate and wholesome information to the end-user. We research on efficient querying to these distributed databases to get top k elements matching the ranking order provided by the user. We also discuss hierarchical way of using the top k algorithm and their limitations to our problem. We propose four different algorithms based on NRA algorithm to solve this problem efficiently and compare and contrast these methods. Once the combination of data sources has been identified, we use our algorithms to get the top elements from these data source combination, process them to get the top k elements according to the user's ranking function. en_US
dc.description.sponsorship Das, Gautam en_US
dc.language.iso EN en_US
dc.publisher Computer Science & Engineering en_US
dc.title Top K Query Processing In Distributed Database en_US
dc.type M.S. en_US
dc.contributor.committeeChair Das, Gautam en_US Computer Science & Engineering en_US Computer Science & Engineering en_US University of Texas at Arlington en_US masters en_US M.S. en_US
dc.identifier.externalLinkDescription Link to Research Profiles

Files in this item

Files Size Format View
umi-uta-1809.pdf 417.2Kb PDF View/Open
417.2Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record


My Account


About Us