Sciweavers

313 search results - page 31 / 63
» Cost-Based Object Query Optimization
Sort
View
COOPIS
2002
IEEE
15 years 2 months ago
On Real-Time Top k Querying for Mobile Services
Mobile services offering multi-feature query capabilities must meet tough response time requirements to gain customer acceptance. The top-k query model is a popular candidate to im...
Wolf-Tilo Balke, Ulrich Güntzer, Werner Kie&s...
NAACL
2010
14 years 7 months ago
Learning Dense Models of Query Similarity from User Click Logs
The goal of this work is to integrate query similarity metrics as features into a dense model that can be trained on large amounts of query log data, in order to rank query rewrit...
Fabio De Bona, Stefan Riezler, Keith Hall, Massimi...
DKE
2006
123views more  DKE 2006»
14 years 9 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
COMCOM
1998
78views more  COMCOM 1998»
14 years 9 months ago
The performance of SQL queries to an X.500 directory system
The X.500 standard speci es a distributed directory service designed to store information about people and objects associated with computer networks. Its API is geared toward retr...
David Barrowman, Patrick Martin
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
15 years 2 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...