๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[ACM Press the 35th SIGMOD international conference - Providence, Rhode Island, USA (2009.06.29-2009.07.02)] Proceedings of the 35th SIGMOD international conference on Management of data - SIGMOD '09 - A revised r*-tree in comparison with related index structures

โœ Scribed by Beckmann, Norbert; Seeger, Bernhard

Book ID
115457871
Publisher
ACM Press
Year
2009
Weight
525 KB
Volume
0
Category
Article
ISBN
1605585513

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

[ACM Press the 35th SIGMOD international
[ACM Press the 35th SIGMOD international conference - Providence, Rhode Island, USA (2009.06.29-2009.07.02)] Proceedings of the 35th SIGMOD international conference on Management of data - SIGMOD '09 - A revised r*-tree in comparison with related index structures
โœ Beckmann, Norbert; Seeger, Bernhard ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› ACM Press โš– 525 KB

In this paper we present an improved redesign of the R\*-tree that is entirely suitable for running within a DBMS. Most importantly, an insertion is guaranteed to be restricted to a single path because re-insertion could be abandoned. We re-engineered both, subtree choice and split algorithm, to be

[ACM Press the 35th SIGMOD international
[ACM Press the 35th SIGMOD international conference - Providence, Rhode Island, USA (2009.06.29-2009.07.02)] Proceedings of the 35th SIGMOD international conference on Management of data - SIGMOD '09 - Query simplification
โœ Neumann, Thomas ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› ACM Press โš– 492 KB

Join ordering is one of the most important, but also most challenging problems of query optimization. In general finding the optimal join order is NP-hard. Existing dynamic programming algorithms exhibit exponential runtime even for the restricted, but highly relevant class of star joins. Therefore,