SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Information Processing Letters

Volumn 12, Issue 4, 1981, Pages 199-202

Hysterical B-trees

(2) Maier, David a Salveter, Sharon C a

a STONY BROOK UNIVERSITY (United States)

Author keywords

B trees; complexity of algorithms; data structures; indexing techniques

Indexed keywords

EID: 0038196057 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/0020-0190(81)90101-0 Document Type: Article

Times cited : (33)

References (9)

1
- 84914863065
- Concurrency of operations on B-trees
- (1976) IBM Res. Rep. RJ1791
- Bayer¹ Schkolnick²

2
- 84914864199
- Design and analysis of a data structure for representing sorted lists
- Stanford University, Computer Science Department
- (1978) Tech. Rep. #STAN-CS-78-709
- Brown¹ Tarjan²

3
- 0018480749
- The ubiquitous B-tree
- (1979) Comput. Surveys , vol.11 , Issue.2
- Comer¹

4
- 0004127616
- Computer Science Press
- (1976) Fundamentals of Data Structures
- Horowitz¹ Sahni²

5
- 84914849733
- unpublished notes
- (1979) The average number of restructurings in 2–3–4 trees with insertions and deletions is constant
- Huddleston¹

6
- 0003657590
- Addison-Wesley, Reading, MA
- (1973) The Art of Computer Programming (Sorting and Searching)
- Knuth¹

7
- 85034648840
- A new data structure for representing sorted list
- unpublished notes
- (1979) A new data structure for representing sorted list
- Melhorn¹

8
- 84915693570
- Multiple access to B-trees
- (1973) Proc. Conf. Information Science and System , pp. 400-407
- Miller¹ Snyder²

9
- 0017009409
- B-trees in a system of multiple users
- (1976) Information Processing Lett. , vol.5 , Issue.4 , pp. 107-112
- Samadi¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.