NDLI: Optimal top-K queries processing: Sampling and dynamic scheduling approach

Content Provider	IEEE Xplore Digital Library
Author	Saranya, L.
Copyright Year	2014
Description	Author affiliation: Dept. of Comput. Sci. & Eng., Bharathiyar Coll. of Eng. & Technol., Kariakal, India (Saranya, L.)
Abstract	An effective query processing plays an important role in the uncertain data streams. Specifically, multiple top-k queries processing on uncertain data streams obtained from large applications of several fields such as sensor network monitoring and internet traffic control requires periodic execution of queries and sharing results among them. The system that monitors uncertain events in such data streams manipulates the top-k queries. Here the problem is that systems were not designed to allow query results sharing which in turn leads to high computation cost and inaccurate response from the system. To overcome these issues (Queries results sharing), the system using a sampling algorithm for sample the top possible worlds from well-known possible worlds based on their high probability. System uses an optimal dynamic programming approach that split the multiple queries into number of groups. Then the query groups are scheduled and planned for sharing results to yield minimum computation cost. A faster greedy algorithm is used to reduce the time and storage space of the top-k queries based on the greedy rule. Thus the proposed approach allows sharing computation among multiple top-k queries and generates best plan of query execution.
Starting Page	1
Ending Page	3
File Size	104381
Page Count	3
File Format	PDF
e-ISBN	9781479923526
DOI	10.1109/ICCCI.2014.6921736
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-01-03
Publisher Place	India
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Greedy algorithms Computers Query Sampling Query processing Heuristic algorithms Top-K Query Data streams Dynamic programming Servers Multi query optimization Monitoring Uncertain data streams
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

Optimizing Multi-Top-k Queries over Uncertain Data Streams

An Efficient Algorithm for top-k Queries on Uncertain Data Streams

Optimal Top-k Queries Processing : Sampling and Dynamic Scheduling Approach

Top-k Queries Processing with Uncertain Data on Graphics Processing Units

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

Cleaning uncertain data for top-k queries.

Ranking queries on uncertain data: a probabilistic threshold approach

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

Finding top-k profitable products

Optimal top-K queries processing: Sampling and dynamic scheduling approach

Similar Documents

Optimizing Multi-Top-k Queries over Uncertain Data Streams

An Efficient Algorithm for top-k Queries on Uncertain Data Streams

Optimal Top-k Queries Processing : Sampling and Dynamic Scheduling Approach

Top-k Queries Processing with Uncertain Data on Graphics Processing Units

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

Cleaning uncertain data for top-k queries.

Ranking queries on uncertain data: a probabilistic threshold approach

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

Finding top-k profitable products

Optimal top-K queries processing: Sampling and dynamic scheduling approach