Sciweavers

707 search results - page 12 / 142
» Processing queries on tree-structured data efficiently
Sort
View
PVLDB
2010
225views more  PVLDB 2010»
13 years 3 months ago
Efficient Processing of Top-k Spatial Preference Queries
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
João B. Rocha-Junior, Akrivi Vlachou, Chris...
CIKM
2009
Springer
14 years 15 days ago
Scalable indexing of RDF graphs for efficient join processing
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
George H. L. Fletcher, Peter W. Beck
ICDE
2009
IEEE
160views Database» more  ICDE 2009»
13 years 6 months ago
Perm: Processing Provenance and Data on the Same Data Model through Query Rewriting
Data provenance is information that describes how a given data item was produced. The provenance includes source and intermediate data as well as the transformations involved in pr...
Boris Glavic, Gustavo Alonso
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
14 years 8 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...
TKDE
2010
251views more  TKDE 2010»
13 years 3 months ago
Exploring Correlated Subspaces for Efficient Query Processing in Sparse Databases
The sparse data is becoming increasingly common and available in many real-life applications. However, relative little attention has been paid to effectively model the sparse data ...
Bin Cui, Jiakui Zhao, Dongqing Yang