NDLI: Global Top-k Aggregate Queries Based on X-tuple in Uncertain Database

Content Provider	IEEE Xplore Digital Library
Author	Dexi Liu Changxuan Wan Naixue Xiong Jong Hyuk Park Sang-Soo Yeoe
Copyright Year	2010
Abstract	A Top-k aggregate query, which is a powerful technique when dealing with large quantity of data, ranks groups of tuples by their aggregate values and returns k groups with the highest aggregate values. However, compared to Top-k in traditional databases, queries over uncertain database are more complicated because of the existence of exponential possible worlds. As a powerful semantic of Top-k in uncertain database, Global Top-k return k highest-ranked tuples according to their probabilities of being in the Top-k answers in possible worlds. We propose a x-tuple based method to process Global Top-k aggregate queries in uncertain database. Our method has two levels, group state generation and G-x-Top-k query processing. In the former level, group states, which satisfy the properties of x-tuple, are generated one after the other according to their aggregate values, while in the latter level, dynamic programming based Global x-tuple Top-k query processing are employed to return the answers. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions.
Starting Page	814
Ending Page	821
File Size	385327
Page Count	8
File Format	PDF
ISBN	9781424467013
e-ISBN	9781424467020
DOI	10.1109/WAINA.2010.183
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-04-20
Publisher Place	Australia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Knowledge engineering Data engineering G-x-Top-k Queries Dynamic Programming Algorithm Power engineering computing Databases Aggregates Query processing Uncertain Database Radar imaging Computer networks Global Top-k Aggregate Queries Dynamic programming Power engineering and energy
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficient Processing of Global Top-k Aggregate Queries in Uncertain Database

Two Novel Semantics of Top-k Queries Processing in Uncertain Database

Efficient Processing of Probabilistic Threshold Top-k Queries Based on X-tuple in Uncertain Database

Efficient processing of top-k queries on uncertain databases (2007)

D.: Efficient processing of Top-k queries in uncertain databases with x-Relations (2008)

D.: Efficient processing of top-k queries in uncertain databases with x-relations (2008)

Efficient processing of top-k queries in uncertain databases (2007)

Urank: formulation and efficient evaluation of top-k queries in uncertain databases (2007)

Efficient processing of ad-hoc top-k aggregate queries in OLAP (2005)

Global Top-k Aggregate Queries Based on X-tuple in Uncertain Database

Similar Documents

Efficient Processing of Global Top-k Aggregate Queries in Uncertain Database

Two Novel Semantics of Top-k Queries Processing in Uncertain Database

Efficient Processing of Probabilistic Threshold Top-k Queries Based on X-tuple in Uncertain Database

Efficient processing of top-k queries on uncertain databases (2007)

D.: Efficient processing of Top-k queries in uncertain databases with x-Relations (2008)

D.: Efficient processing of top-k queries in uncertain databases with x-relations (2008)

Efficient processing of top-k queries in uncertain databases (2007)

Urank: formulation and efficient evaluation of top-k queries in uncertain databases (2007)

Efficient processing of ad-hoc top-k aggregate queries in OLAP (2005)

Global Top-k Aggregate Queries Based on X-tuple in Uncertain Database