Sciweavers

3652 search results - page 39 / 731
» A study of query length
Sort
View
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 7 months ago
Exact Shortest Path Queries for Planar Graphs Using Linear Space
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
Shay Mozes, Christian Sommer
ECIR
2009
Springer
14 years 5 months ago
Classifying and Characterizing Query Intent
Understanding the intent underlying user queries may help personalize search results and improve user satisfaction. In this paper, we develop a methodology for using ad clickthroug...
Azin Ashkan, Charles L. A. Clarke, Eugene Agichtei...
ICDE
2006
IEEE
213views Database» more  ICDE 2006»
14 years 1 months ago
Optimization of Complex Nested Queries in Relational Databases
Due to the flexible structures of SQL, no general approach works efficiently for all kinds of queries. Some special kinds of queries can be further optimized for better performa...
Bin Cao
PODS
2007
ACM
102views Database» more  PODS 2007»
14 years 7 months ago
The complexity of query containment in expressive fragments of XPath 2.0
Query containment has been studied extensively for fragments of
Balder ten Cate, Carsten Lutz
GIS
2003
ACM
14 years 8 months ago
Processing in-route nearest neighbor queries: a comparison of alternative approaches
Nearest neighbor query is one of the most important operations in spatial databases and their application domains, e.g., locationbased services, advanced traveler information syst...
Shashi Shekhar, Jin Soung Yoo