Clustering techniques for minimizing external path length (1996)

by A. A. Diwan , Sanjeeva Rane , S. Seshadri , S. Sudarshan
Venue:Proceedings of the International Conference on Very Large Databases
Citations:18 - 0 self

Documents Related by Co-Citation

25 Packing Trees – Joseph Gil, Alon Itai - 1995
27 Practical Suffix Tree Construction – Sandeep Tata, Richard A. Hankins, Jignesh M. Patel - 2004
38 Efficient Implementation of Lazy Suffix Trees – R. Giegerich, S. Kurtz, J. Stoye - 1999
1108 Multidimensional binary search trees used for associative searching – J L Bentley - 1975
264 Quad trees: a data structure for retrieval on composite keys – R A Finkel, J L Bentley - 1974
488 The R * - Tree: An Efficient and Robust Access Method for Points and Rectangles – N Beckmann, H P Kriegel, R Schneider, B Seeger - 1990
2201 R-trees: A Dynamic Index Structure for Spatial Searching – Antonin Guttman - 1984
85 The universal B-Tree for multidimensional indexing: general concepts. WWCA – R Bayer - 1997
8 The handwritten trie: Indexing electronic ink – W G Aref, D Barbará, P Vallabhaneni - 1995
138 An effective way to represent quad-trees – I Gargantini - 1982
258 Trie memory – Edward Fredkin - 1960
122 The String B-Tree: A New Data Structure for String Search in External Memory and its Applications. – Paolo Ferragina, Roberto Grossi - 1998
561 Multidimensional Access Methods – Volker Gaede, Oliver Günther - 1998
31 Efficient tree layout in a multilevel memory hierarchy, arXiv:cs.DS/0211010 – Stephen Alstrup, Michael A. Bender, Erik D. Demaine - 2003
205 Generalized Search Trees for Database Systems – Joseph M. Hellerstein, Jeffrey F. Naughton, Avi Pfeffer - 1995
55 Approximate string matching over suffix trees – Esko Ukkonen - 1993
22 Database indexing for large DNA and protein sequence collections – Ela Hunt, Malcolm P. Atkinson, Robert W. Irving - 2002
38 Fast approximate matching using suffix trees – A L Cobbs - 1995
426 Linear pattern matching algorithms – P Weiner - 1973