We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
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...
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...
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 ...
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...