Sciweavers

5746 search results - page 412 / 1150
» Visualizing Query Structure
Sort
View
288
Voted
SIGMOD
2009
ACM
111views Database» more  SIGMOD 2009»
16 years 7 months ago
Language-model-based ranking in entity-relation graphs
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
Shady Elbassuoni, Maya Ramanath, Gerhard Weikum
232
Voted
ICPP
1994
IEEE
15 years 11 months ago
Data-Parallel Spatial Join Algorithms
E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spatial data structures, are presented. The domain consists of planar line segment data i.e., Bu...
Erik G. Hoel, Hanan Samet
CIKM
2006
Springer
15 years 11 months ago
Amnesic online synopses for moving objects
We present a hierarchical tree structure for online maintenance of time-decaying synopses over streaming data. We exemplify such an amnesic behavior over streams of locations take...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...
CORIA
2007
15 years 9 months ago
L'arbre recouvrant dans l'interrogation de documents XML
In this paper, we propose a fuzzy model to querying the XML documents, by taking into account not only the document contents, but also their structure. The concept of minimal size ...
Abdeslame Alilouar
IPL
2008
100views more  IPL 2008»
15 years 7 months ago
On the false-positive rate of Bloom filters
Bloom filters are a randomized data structure for membership queries dating back to 1970. Bloom filters sometimes give erroneous answers to queries, called false positives. Bloom a...
Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil ...