55 search results - page 10 / 11 » Processing Distance Join Queries with Constraints |
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
SAC
2003
ACM
14 years 4 days ago
2003
ACM
Query-by-example is the most popular query model for today’s image retrieval systems. A typical query image contains not only relevant objects (e.g., Eiffel Tower), but also ir...
WWW
2008
ACM
14 years 7 months ago
2008
ACM
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
VLDB
2004
ACM
14 years 7 months ago
2004
ACM
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or realtime query responses in su...
CIKM
2007
Springer
13 years 11 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...