Sciweavers

287 search results - page 11 / 58
» Optimization Techniques for Queries with Expensive Methods
Sort
View
IDEAS
2005
IEEE
109views Database» more  IDEAS 2005»
14 years 29 days ago
Efficient Relational Joins with Arithmetic Constraints on Multiple Attributes
We introduce and study a new class of queries that we refer to as ACMA (arithmetic constraints on multiple attributes) queries. Such combinatorial queries require the simultaneous...
Chuang Liu, Lingyun Yang, Ian T. Foster
PAMI
2008
208views more  PAMI 2008»
13 years 7 months ago
BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval
This paper describes BoostMap, a method for efficient nearest neighbor retrieval under computationally expensive distance measures. Database and query objects are embedded into a v...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
DAWAK
2003
Springer
14 years 18 days ago
Computing SQL Queries with Boolean Aggregates
We introduce a new method for optimization of SQL queries with nested subqueries. The method is based on the idea of Boolean aggregates, aggregates that compute the conjunction or ...
Antonio Badia
TJS
2008
105views more  TJS 2008»
13 years 7 months ago
Using a relational database for scalable XML search
XML is a flexible and powerful tool that enables information and security sharing in heterogeneous environments. Scalable technologies are needed to effectively manage the growing...
Rebecca Cathey, Steven M. Beitzel, Eric C. Jensen,...
SIGMOD
2004
ACM
161views Database» more  SIGMOD 2004»
14 years 7 months ago
Approximation Techniques for Spatial Data
Spatial Database Management Systems (SDBMS), e.g., Geographical Information Systems, that manage spatial objects such as points, lines, and hyper-rectangles, often have very high ...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald