Data Replication for External Searching in Static Tree Structures

International Conference on Information and Knowledge Management, Proceedings

Volumn 2000-January, Issue , 2000, Pages 360-367

  Hambrusch, Susanne E ^a   Liu, Chuan Ming ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TREES (MATHEMATICS);

% REDUCTIONS; DATA REPLICATION; STATIC TREES; TREE STRUCTURES;

MAPPING;

EID: 84873353731     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/354756.354841     Document Type: Conference Paper

References (14)

1. Y. Breitbart and H. Korth. Replication and consistency: being lazy helps sometimes. In Proc. of 16-th ACM Symp. on Principles of Database Systems, pages 173-184, 1997.
2. A. A. Diwan, S. Rane, S. Seshadri, and S. Sudarshan. Clustering techniques for minimizing external path length. In Proc. of 22nd Internat. Conf. on Very Large Data Bases, pages 342-353, 1996.
3. A. W.-C. Fu and D. W.-L. Cheung. A transaction replication scheme for a replicated database with node autonomy. In Proc. of 20th International Conference on Very Large Data Bases, pages 214-225, 1994.
4. J. Gil and A. Itai. How to pack trees. Journal of Algorithms, 32, 1999.
5. J. Hellerstein, E. Koutsoupias, and C. Papadimitriou. On the analysis of indexing schemes. In Proc. of 16th ACM Symp. on Principles of Database Systems, pages 249-256, 1997.
6. M. Herlihy. Concurrency and availability as dual properties of replicated atomic data. Journal of the ACM, J ACM, 37(2):257-278, Apr. 1990.
7. M. H. Nodine, M. T. Goodrich, and J. S. Vitter. Blocking for external graph searching. Algorithmica, 16(2):181-214, Aug. 1996.
8. S. Ramaswamy and S. Subramanian. Path caching: A technique for optimal external searching. In Proc. of 13th ACM Symp. on Principles of Database Systems, volume 13, pages 25-35, 1994.
9. H. Samet. Applications of Spatial Data Structures, Computer Graphics, and Image Processing. Addison-Wesley, 1990.
10. S. Subramanian and S. Ramaswamy. The P-range tree: A new data structure for range searching in secondary memory. In Proc. of the 6th Annual Symposium on Discrete Algorithms, pages 378-387, Jan. 1995.
11. P. Triantafillou and F. Xiao. Supporting partial data accesses to replicated data. In Proc. of the 10th International Conference on Data Engineering, pages 32-42, Feb. 1994.
12. J. S. Vitter. External memory algorithms. In Proc. of 17th ACM Symp. on Principles of Database Systems, pages 119-128, 1998.
13. O. Wolfson, S. Jajodia, and Y. Huang. An adaptive data replication algorithm. ACM Transactions on Database Systems, 22(2):255-314, June 1997.
14. O. Wolfson and A. Milo. The multicast policy and its relationship to replicated date placement. ACM Transactions on Database Systems, 16(l):181-205, Mar. 1991.