AFFIC: A Foundation for Index Comparisons

  • Robert Widhopf
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2992)

Abstract

Comparing indexes (UB-Tree, R*-Tree, etc.) on a structural and theoretical level provides upper bounds for their worst-case performance, but it does not reflect the performance in real world applications. Measuring just query executions times is not fair either, but differences may be caused just by bad implementations. Thus, a fair comparison has to take into account the algorithms, their implementation, real world data, data management and queries and I/O behavior as well as run time.

Therefore, we need to take care that the implementations of indexes rely on a common foundation and differ just where there are conceptual differences. Furthermore, the foundation should be simple and flexible in order to allow adding new indexes easily while providing full control to all relevant parts. In our demo we present a small and flexible C++ library fulfilling these requirements. We expect to release this library in 2004 and thus provide a UB-Tree implementation to the database community useful for further research.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Shore - a high-performance, scalable, persistent object repository, version 2.0 (2000), http://www.cs.wisc.edu/shore/
  2. 2.
    java.xxl: extensible and flexible library (2003), http://dbs.mathematik.uni-marburg.de/research/projects/xxl/
  3. 3.
    Postgresql version 7.3.4 (2003), http://www.postgresql.org/
  4. 4.
    Predator - enhanced data type object-relational dbms (2003), http://www.distlab.dk/predator
  5. 5.
    Aoki, P.M.: Generalizing “search” in generalized search trees (extended abstract). In: Proc. ICDE, pp. 380–389. IEEE Computer Society, Los Alamitos (1998)Google Scholar
  6. 6.
    Chen, W., et al.: High level indexing of user-defined types. In: Proc. VLDB, pp. 554–564. Morgan Kaufmann, San Francisco (1999)Google Scholar
  7. 7.
    Fenk, R.: The BUB-Tree. In: Proc. VLDB (2002) (postersession)Google Scholar
  8. 8.
    Hellerstein, J.M., et al.: Generalized search trees for database systems. In: Proc. VLDB, pp. 562–573. Morgan Kaufmann, San Francisco (1995)Google Scholar
  9. 9.
    Informix Dynamic Server with Universal Data Option, Documentation (1999)Google Scholar
  10. 10.
    Markl, V.: Processing Relational Queries using a Multidimensional Access Technique. PhD thesis, DISDBIS, Band 59, Infix Verlag (1999)Google Scholar
  11. 11.
    Microsoft. SQL Server Books Online, Microsoft Foundation (2000)Google Scholar
  12. 12.
    Oracle. Oracle 8i Utilities / Documentation (1999)Google Scholar
  13. 13.
    Ramsak, F., Markl, V., Fenk, R., Zirkel, M., Elhard, K., Bayer, R.: Integrating the UB-Tree into a Database System Kernel. In: Proc. VLDB (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Robert Widhopf
    • 1
  1. 1.FORWISSGarching b. MünchenGermany

Personalised recommendations