ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Performance analysis of a periodic data reorganization algorithm for concurrent Blink-trees in database systems
Full text PdfPdf (684 KB)
Source Symposium on Applied Computing archive
Proceedings of the 1995 ACM symposium on Applied computing table of contents
Nashville, Tennessee, United States
Pages: 40 - 45  
Year of Publication: 1995
ISBN:0-89791-658-1
Authors
Ing-Ray Chen  Institute of Information Engineering, National Cheng Kung University, Tainan, Taiwan
Salah Hassan  Mtel Technologies, Jackson, MS
Sponsors
SIGBIO: ACM Special Interest Group on Biomedical Computing
SIGADA: ACM Special Interest Group on Ada Programming Language
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGICE: ACM Special Interest Group on Individual Computing Environment
SIGAPP: ACM Special Interest Group on Applied Computing
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 13,   Citation Count: 2
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/315891.315901
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Ricardo A. Baeza-Yates, Expected behaviour of B+-trees under random insertions, Acta Informatica, v.26 n.5, p.439-471, 1989  [doi>10.1007/BF00289146]
 
2
F. B. Bastani , I.-R. Chen , W. Hilal, A model for the stability analysis of maintenance strategies for linear list, The Computer Journal, v.34 n.1, p.80-87, Feb. 1991  [doi>10.1093/comjnl/34.1.80]
 
3
Philip A. Bernstein , Vassco Hadzilacos , Nathan Goodman, Concurrency control and recovery in database systems, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1987
 
4
I.R. Chert and S.A. Banawan, "A reduced Markov model for the performance analysis of data structure servers with periodic maintenance," The Computer Journal, Vol. 35, 1992, A363-A368.
 
5
Ing-Ray Chen , S. A. Banawan, Modeling and Analysis of Concurrent Maintenance Policies for Data Structures Using Pointers, IEEE Transactions on Software Engineering, v.19 n.9, p.902-911, September 1993  [doi>10.1109/32.241772]
6
Douglas Comer, Ubiquitous B-Tree, ACM Computing Surveys (CSUR), v.11 n.2, p.121-137, June 1979  [doi>10.1145/356770.356776]
 
7
Leonard Kleinrock, Theory, Volume 1, Queueing Systems, Wiley-Interscience, 1975
8
H. T. Kung , Philip L. Lehman, Concurrent manipulation of binary search trees, ACM Transactions on Database Systems (TODS), v.5 n.3, p.354-382, Sept. 1980  [doi>10.1145/320613.320619]
 
9
Edward D. Lazowska , John Zahorjan , G. Scott Graham , Kenneth C. Sevcik, Quantitative system performance: computer system analysis using queueing network models, Prentice-Hall, Inc., Upper Saddle River, NJ, 1984
10
Philip L. Lehman , s. Bing Yao, Efficient locking for concurrent operations on B-trees, ACM Transactions on Database Systems (TODS), v.6 n.4, p.650-670, Dec. 1981  [doi>10.1145/319628.319663]
 
11
A. Moitra , S. S. Iyengar , F. B. Bastani , I. L. Yen, Multilevel Data Structures: Models and Performance, IEEE Transactions on Software Engineering, v.14 n.6, p.858-867, June 1988  [doi>10.1109/32.6164]
 
12
Yehoshua Sagiv, Concurrent operations on B*-trees with overtaking, Journal of Computer and System Sciences, v.33 n.2, p.275-296, Oct. 1986  [doi>10.1016/0022-0000(86)90021-8]
 
13
R.A. Sahner and K.S. Trivedi, SttrARpE Language Description, Duke University, 1991.

CITED BY  2
Ibrahim Jaluta , Seppo Sippu , Eljas Soisalon-Soininen, Concurrency control and recovery for balanced B-link trees, The VLDB Journal — The International Journal on Very Large Data Bases, v.14 n.2, p.257-277, April 2005
Gary H. Sockut , Balakrishna R. Iyer, Online reorganization of databases, ACM Computing Surveys (CSUR), v.41 n.3, p.1-136, July 2009

INDEX TERMS

Primary Classification:
  E. Data
  E.1 DATA STRUCTURES
      Subjects: Trees

Additional Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.2 Modes of Computation
          Subjects: Probabilistic computation

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory
          Subjects: Trees

  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.4 Systems
          Subjects: Concurrency


Keywords:
B-trees, Blink-trees, algorithm analysis, concurrent maintenance, database, deadlocks, performance analysis, periodic maintenance

Collaborative Colleagues:
Ing-Ray Chen: colleagues
Salah Hassan: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player