792 search results - page 28 / 159 » Computing Iceberg Queries Efficiently |
109
click to vote
ICPADS
2005
IEEE
15 years 3 months ago
2005
IEEE
Data warehouses store large volumes of data according to a multidimensional model with dimensions representing different axes of analysis. OLAP systems (OnLine Analytical Processi...
105
click to vote
COCOON
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
TCSV
2008
14 years 9 months ago
2008
Conventional subspace learning or recent feature extraction methods consider globality as the key criterion to design discriminative algorithms for image classification. We demonst...
168
click to vote
GIS
2007
ACM
15 years 10 months ago
2007
ACM
The increasingly popular GPS technology and the growing amount of trajectory data it generates create the need for developing applications that efficiently store and query traject...
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
Existing studies for mining frequent XML query patterns mainly introduce a straightforward candidate generate-and-test strategy and compute frequencies of candidate query patterns...