Sciweavers

173 search results - page 11 / 35
» Efficient Rank Based KNN Query Processing Over Uncertain Dat...
Sort
View
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...
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
12 years 10 months ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives
ICDE
2009
IEEE
178views Database» more  ICDE 2009»
13 years 5 months ago
Efficient Query Evaluation over Temporally Correlated Probabilistic Streams
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
Bhargav Kanagal, Amol Deshpande
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
14 years 9 months ago
Distributed Structural Relaxation of XPath Queries
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
Georgia Koloniari, Evaggelia Pitoura
ICDE
2008
IEEE
166views Database» more  ICDE 2008»
14 years 8 months ago
A Clustered Index Approach to Distributed XPath Processing
Supporting top-k queries over distributed collections of schemaless XML data poses two challenges. While XML supports expressive query languages such as XPath and XQuery, these la...
Georgia Koloniari, Evaggelia Pitoura