NDLI: Close Dominance Graph: An Efficient Framework for Answering Continuous Top-<inline-formula> <tex-math notation=TeX>(k) </tex-math></inline-formula> Dominating Queries

Content Provider	IEEE Xplore Digital Library
Author	Santoso, B.J. Ge-Ming Chiu
Copyright Year	1989
Abstract	There are two preference-based queries commonly used in database systems: (1) top-k query and (2) skyline query. By combining the ranking rule used in top-\(k\) query and the notion of dominance relationships utilized in the skyline query, a top-\(k\) dominating query emerges, providing a new perspective on data processing. This query returns the \(k\) records with the highest domination scores from the dataset. However, the processing of the top-\(k\) dominating query is complex when the dataset operates under a streaming model. With new data being continuously generated while stale data being removed from the database, a continuous top-\(k\) dominating query (cTKDQ) requires that updated results can be returned to users at any time. This work explores the cTKDQ problem and proposes a unique indexing structure, called a Close Dominance Graph (CDG), to support the processing of a cTKDQ. The CDG provides comprehensive information regarding the dominance relationship between records, which is vital in answering a cTKDQ with a limited search space. The update process for a cTKDQ is then converted to a simple update affecting a small portion of the CDG. Experimental results show that this scheme is able to offer much better performance when compared with existing solutions.
Sponsorship	IEEE IEEE Comput. Soc. Tech. Committee on Data Eng IEEE Computer Society
Starting Page	1853
Ending Page	1865
Page Count	13
File Size	2088159
File Format	PDF
ISSN	10414347
Volume Number	26
Issue Number	8
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computational modeling Data structures Algorithm design and analysis Indexing Query processing Data models dominance relationship top-k dominating query streaming model Anchor set close dominance graph continuous query
Content Type	Text
Resource Type	Article
Subject	Information Systems Computational Theory and Mathematics Computer Science Applications

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

Top-k Dominating Queries on Incomplete Data

Continuous top-k dominating queries in subspaces (2008)

Continuous Top-k Dominating Queries

Efficiently answering probabilistic threshold top-k queries on uncertain data (2007).

Dominant graph: An efficient indexing structure to answer top-k queries

Dynamic Processing of Dominating Queries with Performance Guarantees

Continuous Top-k Dominating Queries in Subspaces

Pareto-based dominant graph: an efficient indexing structure to answer top-k queries.

ABSTRACT Answering Top-k Queries Using Views

Close Dominance Graph: An Efficient Framework for Answering Continuous Top- (k) Dominating Queries

Similar Documents

Top-k Dominating Queries on Incomplete Data

Continuous top-k dominating queries in subspaces (2008)

Continuous Top-k Dominating Queries

Efficiently answering probabilistic threshold top-k queries on uncertain data (2007).

Dominant graph: An efficient indexing structure to answer top-k queries

Dynamic Processing of Dominating Queries with Performance Guarantees

Continuous Top-k Dominating Queries in Subspaces

Pareto-based dominant graph: an efficient indexing structure to answer top-k queries.

ABSTRACT Answering Top-k Queries Using Views

Close Dominance Graph: An Efficient Framework for Answering Continuous Top- (k) Dominating Queries