Skip to main content
SpringerLink
Log in
Book cover

Italian Conference on Algorithms and Complexity

CIAC 2000: Algorithms and Complexity pp 253–262Cite as

Group Updates for Bed-Black Trees

  • Conference paper
  • First Online:

  • 468 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1767))

Abstract

If several keys are inserted into a search structure (or deleted from it) at the same time, it is advantageous to sort the keys and per- form a group update that brings the keys into the structure as a single transaction. A typical application of group updates is full-text index- ing for document databases. Then the words of an inserted or deleted document, together with occurrence information, form the group to be inserted into or deleted from the full-text index. In the present paper a new group update algorithm is presented for red-black search trees. The algorithm is designed in such a way that the concurrent use of the structure is possible.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G.M Adel’son-Vels'kii and E.M. Landis. An algorithm for the organisation of information. Soviet Math. Dokl., 3:1259–1262, 1962.

    Google Scholar 

  2. J. Boyar, R. Fagerberg, and K. Larsen. Amortization results for chromatic search trees, with an application to priority queues. Journal of Computer and System Sciences, 55(3):504–521, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  3. M. Brown and R. Tarjan. Design and analysis of a data structure for representing sorted lists. SIAM Journal of Computing, 9(3):594–614, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  4. C. Faloutsos and S. Christodoulakis. Design of a signature file method that accounts for non-uniform occurrence and query frequencies. In Proc. Intern. Conf. on Very Large Data Bases, pages 165–180, 1985.

    Google Scholar 

  5. C. Faloutsos and H.V. Jagadish. Hybrid text organizations for text databases. In Proc. Advances in Database Technology, volume 580 of LNCS, pages 310–327, 1992.

    Google Scholar 

  6. L.J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE Symposium on Foundations of Computer Science, pages 8–21, 1978.

    Google Scholar 

  7. S.D. Lang, J.R. Driscoll, and J.H. Jou. Batch insertion for tree-structured file organizations improving defirential database representation. Information Systems, 11(2):167–175, 1992.

    Article  Google Scholar 

  8. K. Larsen. Amortized constant relaxed rebalancing using standard rotations. Acta Informatica, 35(10):859–874, 1998.

    Article  MathSciNet  Google Scholar 

  9. K. Larsen, E. Soisalon-Soininen, and P. Widmayer. Relaxed balance through standard rotations. In Proc. 5th Workshop on Algorithms and Data Structures, volume 1272 of LNCS, pages 450–461, August 1997.

    Google Scholar 

  10. L. Malmi and E. Soisalon-Soininen. Group updates for relaxed height-balanced trees. In Proc. 18th ACM Symposium on the Principles of Database Systems, pages 358–367, 1999.

    Google Scholar 

  11. C. Mohan and I. Narang. Algorithms for creating indexes for very large tables without quiescing updates. In Proc. 19th ACM SIGMOD Conf. on the Management of Data, pages 361–370, 1992.

    Google Scholar 

  12. O. Nurmi and E. Soisalon-Soininen. Chromatic binary search trees: A structure for concurrent rebalancing. Acta Informatica, 33:547–557, 1996.

    Article  MathSciNet  Google Scholar 

  13. K. Pollari-Malmi, E. Soisalon-Soininen, and T. Yönen. Concurrency control in Btrees with batch updates. IEEE Transactions on Knowledge and Data Enineering, 8(6):975–983, 1996.

    Article  Google Scholar 

  14. M. Rossi. Concurrent full text database. Master’s thesis, Department of Computer Science, Helsinki University of Technology, Department of Computer Science and Engineering, Finland, 1997.

    Google Scholar 

  15. E. Soisalon-Soininen and P. Widmayer. Concurrency and recovery in full-text indexing. In Proc. Symposium on String Processing and Information Retrieval (SPIRE'99), pages 192–198. IEEE Computer Society, 1999.

    Google Scholar 

  16. V. Srinivasan and M.J. Carey. Performance of on-line index construction algorithms. In Proc. Advances in Database Technology, volume 580 of LNCS, pages 293–309, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Freiburg, Am Flughafen 17, D-79110, Freiburg, Germany

    Sabine Hanke

  2. Department of Computer Science and Engineering, Helsinki University of Technology, P.O.Box 5400, FIN02015, HUT, Finland

    Eljas Soisalon-Soininen

Authors
  1. Sabine Hanke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eljas Soisalon-Soininen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Rome “La Sapienza”, Via Salaria 113, 00198, Rome, Italy

    Giancarlo Bongiovanni  & Rossella Petreschi  & 

  2. Department of Mathematics, University of Rome “Tor Vergata”, Via della Ricerca Scientifica 1, 00133, Rome, Italy

    Giorgio Gambosi

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hanke, S., Soisalon-Soininen, E. (2000). Group Updates for Bed-Black Trees. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds) Algorithms and Complexity. CIAC 2000. Lecture Notes in Computer Science, vol 1767. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46521-9_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-46521-9_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67159-6

  • Online ISBN: 978-3-540-46521-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation