DocumentCode
564976
Title
An I/O cost optimal and progressive algorithm for computing massive skyline points
Author
Talebi, Mohammadmehdi ; Razzazi, Mohammadreza
Author_Institution
Dept. Of Comput. Eng. &IT, Amirkabir Univ. Of Technol., Tehran, Iran
fYear
2012
fDate
21-25 May 2012
Firstpage
333
Lastpage
338
Abstract
We describe an I/O cost optimal algorithm for computing skyline points among a set of d-dimensional points. In this paper we develop Partitioning, a progressive algorithm based on branch and bound search. It computes the skyline points in a progressive way that is outputting results while the algorithm is running. Our progressive (or online) algorithm can quickly return the first skyline point, without having to read the entire data file, this property is important in the database community.
Keywords
computational geometry; data handling; search problems; tree searching; I/O cost optimal algorithm; I/O cost progressive algorithm; branch and bound search; computational geometry; computing massive skyline points; d-dimensional points; database community; Aggregates; Indexing; Organizing; Partitioning algorithms; Spatial databases; Strontium; I/O cost; Maxima; Query; Skyline; Spatial databases;
fLanguage
English
Publisher
ieee
Conference_Titel
MIPRO, 2012 Proceedings of the 35th International Convention
Conference_Location
Opatija
Print_ISBN
978-1-4673-2577-6
Type
conf
Filename
6240666
Link To Document