Sciweavers

4337 search results - page 178 / 868
» Cache-Oblivious Query Processing
Sort
View
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
14 years 11 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
MDM
2009
Springer
116views Communications» more  MDM 2009»
14 years 5 months ago
Finding Probabilistic Nearest Neighbors for Query Objects with Imprecise Locations
—A nearest neighbor query is an important notion in spatial databases and moving object databases. In the emerging application fields of moving object technologies, such as mobi...
Yuichi Iijima, Yoshiharu Ishikawa
DASFAA
2007
IEEE
202views Database» more  DASFAA 2007»
14 years 4 months ago
Optimizing Moving Queries over Moving Object Data Streams
With the increasing in demand on location-based aware services and RFIDs, efficient processing of continuous queries over moving object streams becomes important. In this paper, w...
Dan Lin, Bin Cui, Dongqing Yang
ER
2003
Springer
148views Database» more  ER 2003»
14 years 3 months ago
Improving Query Performance Using Materialized XML Views: A Learning-Based Approach
We consider the problem of improving the efficiency of query processing on an XML interface of a relational database, for predefined query workloads. The main contribution of this ...
Ashish Shah, Rada Chirkova
VLDB
1998
ACM
120views Database» more  VLDB 1998»
14 years 2 months ago
Algorithms for Querying by Spatial Structure
: Structural queries constitute a special form of content-basedretrieval where the user specifiesa set of spatial constraints among query variables and asks for all configurations ...
Dimitris Papadias, Nikos Mamoulis, Vasilis Delis