NDLI: Continuous Possible K-Nearest Skyline Query in Euclidean Spaces

Content Provider	IEEE Xplore Digital Library
Author	Yuan-Ko Huang Zong-Han He Chiang Lee Wu-Hsiu Kuo
Copyright Year	2013
Description	Author affiliation: Dept. of Comput. Sci. & Inf. Eng., Nat. Cheng-Kung Univ., Tainan, Taiwan (Zong-Han He; Chiang Lee; Wu-Hsiu Kuo) \|\| Dept. of Inf. Commun., Kao-Yuan Univ., Kaohsiung, Taiwan (Yuan-Ko Huang)
Abstract	Continuous K-nearest skyline query (CKNSQ) is an important type of the spatio-temporal queries. Given a query time interval [ts, te] and a moving query object q, a CKNSQ is to retrieve the K-nearest skyline points of q at each time instant within [ts, te]. Different from the previous works, our work devotes to overcoming the past assumption that each object is static with certain dimensional values and located in road networks. In this paper, we focus on processing the CKNSQ over moving objects with uncertain dimensional values in Euclidean space and the velocity of each object (including the query object) varies within a known range. Such a query is called the continuous possible K-nearest skyline query (CPKNSQ). We first discuss the difficulties raised by the uncertainty of object and then propose the CPKNSQ algorithm operated with a data partitioning index, called the uncertain TPR-tree (UTPR-tree), to efficiently answer the CPKNSQ.
Sponsorship	IEEE Tech. Comm. Distrib. Process.
Starting Page	174
Ending Page	181
File Size	627777
Page Count	8
File Format	PDF
ISBN	9781479920815
ISSN	15219097
DOI	10.1109/ICPADS.2013.35
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-12-15
Publisher Place	South Korea
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Indexes Vectors Uncertainty Algorithm design and analysis Educational institutions Electronic mail Conferences continuous possible K-nearest skyline query Continuous K-nearest skyline query spatio-temporal queries uncertain dimensional values Euclidean space
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture

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

Processing continuous K-nearest skyline query with uncertainty in spatio-temporal databases

Processing KNN Queries in Grid-Based Sensor Networks

STUN: Spatio-Temporal Uncertain (Social) Networks

A survey of queries over uncertain data

Abstract continuous skyline queries for moving objects.

Efficient computation for k-dominant skyline queries with domination power index

Scalable processing of snapshot and continuous nearest-neighbor queries over one-dimensional uncertain data

Multi-level continuous skyline queries (MCSQ)

A Partitioned-Based Method of Convex Skyline for Efficient Processing Top-k Queries

Continuous Possible K-Nearest Skyline Query in Euclidean Spaces

Similar Documents

Processing continuous K-nearest skyline query with uncertainty in spatio-temporal databases

Processing KNN Queries in Grid-Based Sensor Networks

STUN: Spatio-Temporal Uncertain (Social) Networks

A survey of queries over uncertain data

Abstract continuous skyline queries for moving objects.

Efficient computation for k-dominant skyline queries with domination power index

Scalable processing of snapshot and continuous nearest-neighbor queries over one-dimensional uncertain data

Multi-level continuous skyline queries (MCSQ)

A Partitioned-Based Method of Convex Skyline for Efficient Processing Top-k Queries

Continuous Possible K-Nearest Skyline Query in Euclidean Spaces