Sciweavers

1889 search results - page 221 / 378
» Re-ranking search results using query logs
Sort
View
EDBT
2002
ACM
188views Database» more  EDBT 2002»
16 years 6 months ago
Approximate Processing of Multiway Spatial Joins in Very Large Databases
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
Dimitris Papadias, Dinos Arkoumanis
FGCS
2000
81views more  FGCS 2000»
15 years 6 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
INFOCOM
2006
IEEE
16 years 18 days ago
Performance of Full Text Search in Structured and Unstructured Peer-to-Peer Systems
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
Yong Yang, Rocky Dunlap, Mike Rexroad, Brian F. Co...
EDBT
2009
ACM
164views Database» more  EDBT 2009»
15 years 11 months ago
Fast object search on road networks
In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search...
Ken C. K. Lee, Wang-Chien Lee, Baihua Zheng
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
16 years 8 months ago
Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases
We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses structured data values to score (rank) the results of keyword search que...
Lin Guo, Jayavel Shanmugasundaram, Kevin S. Beyer,...