Full metadata record
|dc.contributor||Department of Computing||en_US|
|dc.contributor.advisor||Yiu, Ken (COMP)||en_US|
|dc.publisher||Hong Kong Polytechnic University||en_US|
|dc.rights||All rights reserved||en_US|
|dc.title||Approximate processing and algorithms in SQL basic query||en_US|
|dcterms.abstract||In big databases, the approximated results could replace the accurate ones when high efficiency is required. The problem is called Approximate Query Processing (AQP) . There are two major approaches: online aggregation and offline synopses generation. Online aggregation [5, 6] uses a smaller sample to represent the whole database while offline synopses generation, generate synopses offline based on prior knowledge. In this dissertation, we will improve the sample selection and combined the advantages of online aggregation with a new system called SDIS. The dissertation is divided into 4 sections. i). Introduction of problem, ii). Related work of current solution, iii). Our idea and SDIS system, iv). The results and conclusion.||en_US|
|dcterms.extent||vii, 42 pages : color illustrations||en_US|
|dcterms.isPartOf||PolyU Electronic Theses||en_US|
|dcterms.LCSH||Querying (Computer science)||en_US|
|dcterms.LCSH||Hong Kong Polytechnic University -- Dissertations||en_US|
Files in This Item:
|5865.pdf||For All Users (off-campus access for PolyU Staff & Students only)||1.01 MB||Adobe PDF||View/Open|
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item: