We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is managed ...
Vijayshankar Raman, Amol Deshpande, Joseph M. Hell...
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
XML databases often contain documents comprising structured text. Therefore, it is important to integrate "information retrieval style" query evaluation, which is well-s...
For content level access, very often database needs the query as a sample image. However, the image may contain private information and hence the user does not wish to reveal the ...
Abstract-- In this paper we describe an optimal reconfiguration planning algorithm that morphs a grounded truss structure of known geometry into a new geometry. The plan consists o...
Seung-kook Yun, David Alan Hjelle, Eric Schweikard...