Sciweavers

508 search results - page 66 / 102
» Bringing Order to Query Optimization
Sort
View
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
14 years 9 months ago
Venn Sampling: A Novel Prediction Technique for Moving Objects
Given a region qR and a future timestamp qT, a "range aggregate" query estimates the number of objects expected to appear in qR at time qT. Currently the only methods fo...
Yufei Tao, Dimitris Papadias, Jian Zhai, Qing Li
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
14 years 8 months ago
Scalable join processing on very large RDF graphs
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
Thomas Neumann, Gerhard Weikum
CIKM
2009
Springer
14 years 2 months ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
TREC
2004
13 years 9 months ago
University of Glasgow at TREC 2004: Experiments in Web, Robust, and Terabyte Tracks with Terrier
With our participation in TREC2004, we test Terrier, a modular and scalable Information Retrieval framework, in three tracks. For the mixed query task of the Web track, we employ ...
Vassilis Plachouras, Ben He, Iadh Ounis
CIKM
2011
Springer
12 years 7 months ago
Estimating selectivity for joined RDF triple patterns
A fundamental problem related to RDF query processing is selectivity estimation, which is crucial to query optimization for determining a join order of RDF triple patterns. In thi...
Hai Huang 0003, Chengfei Liu