Sciweavers

342 search results - page 12 / 69
» Branch-and-bound processing of ranked queries
Sort
View
DASFAA
2009
IEEE
104views Database» more  DASFAA 2009»
14 years 2 months ago
On the Discovery of Conserved XML Query Patterns for Evolution-Conscious Caching
Existing xml query pattern-based caching strategies focus on extracting the set of frequently issued query pattern trees (qpt) based on the support of the qpts in the history. Thes...
Sourav S. Bhowmick
SEMWEB
2010
Springer
13 years 5 months ago
Linked Data Query Processing Strategies
Abstract. Recently, processing of queries on linked data has gained attention. We identify and systematically discuss three main strategies: a bottom-up strategy that discovers new...
Günter Ladwig, Thanh Tran
PVLDB
2010
225views more  PVLDB 2010»
13 years 2 months ago
Efficient Processing of Top-k Spatial Preference Queries
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
João B. Rocha-Junior, Akrivi Vlachou, Chris...
ICDE
2003
IEEE
114views Database» more  ICDE 2003»
14 years 8 months ago
Ranked Join Indices
A plethora of data sources contain data entities that could be ordered according to a variety of attributes associated with the entities. Such orderings result effectively in a ra...
Panayiotis Tsaparas, Themistoklis Palpanas, Yannis...
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 7 months ago
Rank-aware Query Optimization
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey ...