Sciweavers

17 search results - page 3 / 4
» Rule-Based Query Optimization, Revisited
Sort
View
ICDE
2012
IEEE
196views Database» more  ICDE 2012»
11 years 10 months ago
Scalable Multi-query Optimization for SPARQL
Abstract—This paper revisits the classical problem of multiquery optimization in the context of RDF/SPARQL. We show that the techniques developed for relational and semi-structur...
Wangchao Le, Anastasios Kementsietsidis, Songyun D...
CGF
2008
139views more  CGF 2008»
13 years 8 months ago
CHC++: Coherent Hierarchical Culling Revisited
We present a new algorithm for efficient occlusion culling using hardware occlusion queries. The algorithm significantly improves on previous techniques by making better use of te...
Oliver Mattausch, Jirí Bittner, Michael Wim...
COMPGEOM
2010
ACM
14 years 1 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
SIGMOD
2005
ACM
162views Database» more  SIGMOD 2005»
14 years 8 months ago
Clio grows up: from research prototype to industrial tool
Clio, the IBM Research system for expressing declarative schema mappings, has progressed in the past few years from a research prototype into a technology that is behind some of I...
Laura M. Haas, Mauricio A. Hernández, Howar...
CINQ
2004
Springer
163views Database» more  CINQ 2004»
14 years 1 months ago
Frequent Itemset Discovery with SQL Using Universal Quantification
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Ralf Rantzau