Sciweavers

517 search results - page 58 / 104
» Efficient Computation of Diverse Query Results
Sort
View
TKDE
2010
195views more  TKDE 2010»
13 years 6 months ago
Query Processing Using Distance Oracles for Spatial Networks
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as findin...
Jagan Sankaranarayanan, Hanan Samet
EDBT
2008
ACM
169views Database» more  EDBT 2008»
14 years 7 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru
VLDB
2004
ACM
137views Database» more  VLDB 2004»
14 years 1 months ago
Schema-Free XQuery
The widespread adoption of XML holds out the promise that document structure can be exploited to specify precise database queries. However, the user may have only a limited knowle...
Yunyao Li, Cong Yu, H. V. Jagadish
VLDB
1987
ACM
104views Database» more  VLDB 1987»
13 years 11 months ago
Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
Georges Gardarin
SAC
2008
ACM
13 years 7 months ago
Selectivity estimation in spatial networks
Modern applications requiring spatial network processing pose many interesting query optimization challenges. In many cases, query processing depends on the corresponding graph si...
Eleftherios Tiakas, Apostolos N. Papadopoulos, Ale...