Sciweavers

2539 search results - page 237 / 508
» Updates for Structure Indexes
Sort
View
DKE
2008
96views more  DKE 2008»
15 years 6 months ago
Fragment-based approximate retrieval in highly heterogeneous XML collections
Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents ...
Ismael Sanz, Marco Mesiti, Giovanna Guerrini, Rafa...
DATESO
2009
158views Database» more  DATESO 2009»
15 years 4 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
16 years 6 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...
ISLPED
2004
ACM
108views Hardware» more  ISLPED 2004»
16 years 1 days ago
SEPAS: a highly accurate energy-efficient branch predictor
Designers have invested much effort in developing accurate branch predictors with short learning periods. Such techniques rely on exploiting complex and relatively large structure...
Amirali Baniasadi, Andreas Moshovos
COMPGEOM
2000
ACM
15 years 11 months ago
Kinetic connectivity for unit disks
We describe a kinetic data structure (KDS) that maintains the connected components of the union of a set of unit-radius disks moving in the plane. We assume that the motion of eac...
Leonidas J. Guibas, John Hershberger, Subhash Suri...