Sciweavers

63 search results - page 1 / 13
» Finding k-dominant skylines in high dimensional space
Sort
View
SIGMOD
2006
ACM
110views Database» more  SIGMOD 2006»
14 years 4 months ago
Finding k-dominant skylines in high dimensional space
Given a d-dimensional data set, a point p dominates another point q if it is better than or equal to q in all dimensions and better than q in at least one dimension. A point is a ...
Chee Yong Chan, H. V. Jagadish, Kian-Lee Tan, Anth...
EDBT
2006
ACM
182views Database» more  EDBT 2006»
14 years 4 months ago
On High Dimensional Skylines
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...
Chee Yong Chan, H. V. Jagadish, Kian-Lee Tan, Anth...
SIGMOD
2009
ACM
191views Database» more  SIGMOD 2009»
14 years 4 months ago
Scalable skyline computation using object-based space partitioning
The skyline operator returns from a set of multi-dimensional objects a subset of superior objects that are not dominated by others. This operation is considered very important in ...
Shiming Zhang, Nikos Mamoulis, David W. Cheung
VLDB
2007
ACM
129views Database» more  VLDB 2007»
14 years 4 months ago
Efficient Skyline Computation over Low-Cardinality Domains
Current skyline evaluation techniques follow a common paradigm that eliminates data elements from skyline consideration by finding other elements in the dataset that dominate them...
Michael D. Morse, Jignesh M. Patel, H. V. Jagadish
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
13 years 9 months ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu