Sciweavers

1429 search results - page 122 / 286
» Efficient processing of XPath queries using indexes
Sort
View
ICDE
2008
IEEE
130views Database» more  ICDE 2008»
14 years 10 months ago
Efficient Computation of Diverse Query Results
We study the problem of efficiently computing diverse query results in online shopping applications, where users specify queries through a form interface that allows a mix of stru...
Erik Vee, Utkarsh Srivastava, Jayavel Shanmugasund...
GIS
1997
ACM
14 years 17 days ago
Speeding up Bulk-Loading of Quadtrees
Spatial indexes, such as the PMR quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints, especially when the queries involve...
Gísli R. Hjaltason, Hanan Samet, Yoram J. S...
DAWAK
2001
Springer
14 years 1 months ago
Adaptable Similarity Search Using Vector Quantization
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining applications, particularly for domains such as multimedia, CAD, molecular ...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
SSDBM
1999
IEEE
135views Database» more  SSDBM 1999»
14 years 1 months ago
Query Processing in the TAMBIS Bioinformatics Source Integration System
Conducting bioinformatic analyses involves biologists in expressing requests over a range of highly heterogeneous information sources and software tools. Such activities are labor...
Norman W. Paton, Robert Stevens, Patricia G. Baker...
SSD
2005
Springer
105views Database» more  SSD 2005»
14 years 2 months ago
Evaluation of Top-k OLAP Queries Using Aggregate R-Trees
Abstract. A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example ...
Nikos Mamoulis, Spiridon Bakiras, Panos Kalnis