Sciweavers

792 search results - page 17 / 159
» Computing Iceberg Queries Efficiently
Sort
View
HPDC
2010
IEEE
13 years 10 months ago
Efficient querying of distributed provenance stores
Current projects that automate the collection of provenance information use a centralized architecture for managing the resulting metadata - that is, provenance is gathered at rem...
Ashish Gehani, Minyoung Kim, Tanu Malik
CGF
2005
99views more  CGF 2005»
13 years 8 months ago
N-Buffers for efficient depth map query
We introduce the N-buffer as a tool for multiresolution depth map representation. This neighborhood buffer encodes the value and position of local depth extrema at different scale...
Xavier Décoret
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 9 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
CCCG
2008
13 years 10 months ago
An Efficient Query Structure for Mesh Refinement
We are interested in the following mesh refinement problem: given an input set of points P in Rd , we would like to produce a good-quality triangulation by adding new points in P....
Benoît Hudson, Duru Türkoglu
ICDE
2009
IEEE
205views Database» more  ICDE 2009»
14 years 10 months ago
Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
Thanh Tran, Haofen Wang, Sebastian Rudolph, Philip...