loading...
Skyline with Presorting
Bangalore, India March 05-March 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.2003.126084619th International Conference on Data ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Jan Chomicki, University at Buffalo, NY
Parke Godfrey, The College of William and Mary, VA; York University, Toronto, ON
Jarek Gryz, York University, Toronto, ON
Dongming Liang, York University, Toronto, ON
The skyline, or Pareto, operator selects those tuples that are not dominated by any others. Extending relational systems with the skyline operator would offer a basis for handling preference queries. Good algorithms are needed for skyline, however, to make this efficient in a relational settng. We propose a skyline algorithm, SFS, based on presorting that is general, for use with any skyline query, efficient, and well behaved in a relational setting.
Citation:
Jan Chomicki, Parke Godfrey, Jarek Gryz, Dongming Liang, "Skyline with Presorting," icde, pp.717, 19th International Conference on Data Engineering (ICDE'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions