Sciweavers

491 search results - page 45 / 99
» Optimizing Large OODB Queries
Sort
View
VLDB
2001
ACM
94views Database» more  VLDB 2001»
14 years 7 days ago
FeedbackBypass: A New Approach to Interactive Similarity Query Processing
In recent years, several methods have been proposed for implementing interactive similarity queries on multimedia databases. Common to all these methods is the idea to exploit use...
Ilaria Bartolini, Paolo Ciaccia, Florian Waas
ICDE
2007
IEEE
218views Database» more  ICDE 2007»
14 years 9 months ago
SKYPEER: Efficient Subspace Skyline Computation over Distributed Data
Skyline query processing has received considerable attention in the recent past. Mainly, the skyline query is used to find a set of non dominated data points in a multidimensional...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
13 years 9 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
14 years 8 months ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 8 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...