Sciweavers

4037 search results - page 687 / 808
» Routing without ordering
Sort
View
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
16 years 4 months ago
Fg-index: towards verification-free query processing on graph databases
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
James Cheng, Yiping Ke, Wilfred Ng, An Lu
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
16 years 4 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
16 years 4 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...
154
Voted
SIGMOD
2003
ACM
125views Database» more  SIGMOD 2003»
16 years 4 months ago
An Optimal and Progressive Algorithm for Skyline Queries
The skyline of a set of d-dimensional points contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerabl...
Dimitris Papadias, Yufei Tao, Greg Fu, Bernhard Se...
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
16 years 4 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo