Abstract. We consider query execution strategies for object-oriented distributed databases. There are several scenarios of query decomposition, assuming that the corresponding quer...
Hanna Kozankiewicz, Krzysztof Stencel, Kazimierz S...
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
In this work we look at combining emerging technologies in programming languages with traditional query processing techniques to provide support for efficient execution of declarat...
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha ...
During the last decade various spatial data structures have been designed and compared against each other with respect to their performance. Still missing is a lower bound result,...