Organization and Maintenance of Large Ordered Indexes-Reference-Cited by-同舟云学术

Organization and Maintenance of Large Ordered Indexes

Published:2002 Issue: Volume: Page:245-262
ISSN:
Container-title:Software Pioneers
language:
Short-container-title:

Author:

Bayer R.,McCreight E.

Publisher

Springer Berlin Heidelberg

Link

https://link.springer.com/content/pdf/10.1007/978-3-642-59412-0_15

Reference4 articles.

1. Adeison-Velskii, G. M., Landis, E. M.: An information organization algorithm. DANSSSR, 146, 263–266 (1962).

2. Foster, C. C.: Information storage and retrieval using AVL trees. Proc. ACM 20th Nat’l. Conf. 192–205 (1965).

3. Landauer, W. I.; The balanced tree and its utilization in information retrieval. IEEE Trans, on Electronic Computers, Vol. EC-12, No. 6, December 1963.

4. Sussenguth, E. H., Jr.: The use of tree structures for processing files. Comm. ACM, 6, No. 5, May 1963.

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. LETUS: A Log-Structured Efficient Trusted Universal BlockChain Storage;Companion of the 2024 International Conference on Management of Data;2024-06-09

2. How to manage massive spatiotemporal dataset from stationary and non-stationary sensors in commercial DBMS?;Knowledge and Information Systems;2023-11-20

3. Range-Based Set Reconciliation;2023 42nd International Symposium on Reliable Distributed Systems (SRDS);2023-09-25

4. Composite Radix Tree-A Storage Method for Efficient Retrieval of Massive Data;2021 China Automation Congress (CAC);2021-10-22

5. Constant-level spatio-temporal integrated search algorithm for repeating sun-synchronous orbit satellite images;International Journal of Digital Earth;2021-04-12