Sciweavers

792 search results - page 6 / 159
» Computing Iceberg Queries Efficiently
Sort
View
IJRR
2008
80views more  IJRR 2008»
13 years 7 months ago
Efficient Cell Labelling and Path Non-existence Computation using C-obstacle Query
Liangjun Zhang, Young J. Kim, Dinesh Manocha
ICASSP
2011
IEEE
12 years 11 months ago
Efficient search of music pitch contours using wavelet transforms and segmented dynamic time warping
We propose a method of music melody matching based on their “continuous” (or “time-frame-based”) pitch contours. Most previous methods using frame-based contours either ma...
Woojay Jeon, Changxue Ma
ICDE
2005
IEEE
173views Database» more  ICDE 2005»
14 years 9 months ago
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
We consider the problem of efficiently computing the skyline against the most recent N elements in a data stream seen so far. Specifically, we study the n-of-N skyline queries; th...
Xuemin Lin, Yidong Yuan, Wei Wang 0011, Hongjun Lu
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
14 years 9 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
SIGMOD
2008
ACM
182views Database» more  SIGMOD 2008»
14 years 7 months ago
Angle-based space partitioning for efficient parallel skyline computation
Recently, skyline queries have attracted much attention in the database research community. Space partitioning techniques, such as recursive division of the data space, have been ...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...