Sciweavers

709 search results - page 6 / 142
» Efficient Evaluation of All-Nearest-Neighbor Queries
Sort
View
CDB
2004
Springer
158views Database» more  CDB 2004»
13 years 11 months ago
Constraint Databases, Data Structures and Efficient Query Evaluation
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
Joos Heintz, Bart Kuijpers
CORR
1999
Springer
116views Education» more  CORR 1999»
13 years 7 months ago
Efficient and Extensible Algorithms for Multi Query Optimization
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a singl...
Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bh...
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 7 months ago
Efficient Query Evaluation over Compressed XML Data
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
Andrei Arion, Angela Bonifati, Gianni Costa, Sandr...
PODS
2002
ACM
154views Database» more  PODS 2002»
14 years 7 months ago
How to Evaluate Multiple Range-Sum Queries Progressively
Decision support system users typically submit batches of range-sum queries simultaneously rather than issuing individual, unrelated queries. We propose a wavelet based technique ...
Rolfe R. Schmidt, Cyrus Shahabi
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud