Algorithms and Data Structures for External Memory

More documents

Recommendations

Info

References 173 [341] J. S. Vitter and P. Flajolet, “Average-case analysis of algorithms and data structures,” in Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, (J. van Leeuwen, ed.), ch. 9, pp. 431–524, Elsevier and MIT Press, 1990. [342] J. S. Vitter and D. A. Hutchinson, “Distribution sort with randomized cycling,” Journal of the ACM, vol. 53, pp. 656–680, July 2006. [343] J. S. Vitter and P. Krishnan, “Optimal prefetching via data compression,” Journal of the ACM, vol. 43, pp. 771–793, September 1996. [344] J. S. Vitter and M. H. Nodine, “Large-scale sorting in uniform memory hierarchies,” Journal of Parallel and Distributed Computing, vol. 17, pp. 107–114, 1993. [345] J. S. Vitter and E. A. M. Shriver, “Algorithms for parallel memory I: Two-level memories,” Algorithmica, vol. 12, no. 2–3, pp. 110–147, 1994. [346] J. S. Vitter and E. A. M. Shriver, “Algorithms for parallel memory II: Hierarchical multilevel memories,” Algorithmica, vol. 12, no. 2–3, pp. 148–169, 1994. [347] J. S. Vitter and M. Wang, “Approximate computation of multidimensional aggregates of sparse data using wavelets,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 193–204, Philadelphia: ACM Press, June 1999. [348] J. S. Vitter, M. Wang, and B. Iyer, “Data cube approximation and histograms via wavelets,” in Proceedings of the International ACM Conference on Information and Knowledge Management, pp. 96–104, Washington, DC: ACM Press, November 1998. [349] M. Wang, B. Iyer, and J. S. Vitter, “Scalable mining for classification rules in relational databases,” in Herman Rubin Festschrift, Hayward, CA: Institute of Mathematical Statistics, Fall 2004. [350] M. Wang, J. S. Vitter, L. Lim, and S. Padmanabhan, “Wavelet-based cost estimation for spatial queries,” in Proceedings of the International Symposium on Spatial and Temporal Databases, pp. 175–196, Redondo Beach, Cal.: Springer-Verlag, July 2001. [351] R. W. Watson and R. A. Coyne, “The parallel I/O architecture of the highperformance storage system (HPSS),” in Proceedings of the IEEE Symposium on Mass Storage Systems, pp. 27–44, September 1995. [352] P. Weiner, “Linear pattern matching algorithm,” in Proceedings of the IEEE Symposium on Switching and Automata Theory, pp. 1–11, 1973. [353] K.-Y. Whang and R. Krishnamurthy, “Multilevel grid files — a dynamic hierarchical multidimensional file structure,” in Proceedings of the International Symposium on Database Systems for Advanced Applications, pp. 449–459, World Scientific Press, 1992. [354] D. E. Willard and G. S. Lueker, “Adding range restriction capability to dynamic data structures,” Journal of the ACM, vol. 32, no. 3, pp. 597–617, 1985. [355] I. H. Witten, A. Moffat, and T. C. Bell, Managing Gigabytes: Compressing and Indexing Documents and Images. Los Altos, Cal.: Morgan Kaufmann, 2nd ed., 1999.
174 References [356] O. Wolfson, P. Sistla, B. Xu, J. Zhou, and S. Chamberlain, “DOMINO: Databases for moving objects tracking,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 547–549, Philadelphia: ACM Press, June 1999. [357] D. Womble, D. Greenberg, S. Wheat, and R. Riesen, “Beyond core: Making parallel computer I/O practical,” in Proceedings of the DAGS Symposium on Parallel Computation, pp. 56–63, June 1993. [358] C. Wu and T. Feng, “The universality of the shuffle-exchange network,” IEEE Transactions on Computers, vol. C-30, pp. 324–332, May 1981. [359] Y. Xia, S. Prabhakar, S. Lei, R. Cheng, and R. Shah, “Indexing continuously changing data with mean-variance tree,” in Proceedings of the ACM Symposium on Applied Computing, pp. 52–57, ACM Press, March 2005. [360] A. C. Yao, “On random 2-3 trees,” Acta Informatica, vol. 9, pp. 159–170, 1978. [361] S. B. Zdonik and D. Maier, eds., Readings in object-oriented database systems. Morgan Kauffman, 1990. [362] N. Zeh, I/O-Efficient Algorithms for Shortest Path Related Problems. PhD thesis, School of Computer Science, Carleton University, 2002. [363] W. Zhang and P.-A. Larson, “Dynamic memory adjustment for external mergesort,” in Proceedings of the International Conference on Very Large Databases, pp. 376–385, 1997. [364] B. Zhu, “Further computational geometry in secondary memory,” in Proceedings of the International Symposium on Algorithms and Computation, pp. 514– 522, Springer-Verlag, 1994. [365] J. Ziv and A. Lempel, “Compression of individual sequences via variable-rate coding,” IEEE Transactions on Information Theory, vol. 24, pp. 530–536, September 1978.
Page 1 and 2:
TCSv2n4.qxd 4/24/2008 11:56 AM Page
Page 4 and 5:
Algorithms and Data Structures for
Page 6 and 7:
Foundations and Trends R○ in Theo
Page 8 and 9:
Foundations and Trends R○ in Theo
Page 10 and 11:
Preface I first became fascinated a
Page 12:
Preface xi I would like to thank my
Page 15 and 16:
xiv Contents 6 Lower Bounds on I/O
Page 18 and 19:
1 Introduction The world is drownin
Page 20 and 21:
However, not all memory references
Page 22 and 23:
1.1 Overview 5 Our general goal is
Page 24:
Table 1.1 Paradigms for I/O efficie
Page 27 and 28:
10 Parallel Disk Model (PDM) spindl
Page 29 and 30:
12 Parallel Disk Model (PDM) D = nu
Page 31 and 32:
14 Parallel Disk Model (PDM) The pr
Page 33 and 34:
16 Parallel Disk Model (PDM) 2.3 Re
Page 35 and 36:
18 Parallel Disk Model (PDM) archit
Page 38 and 39:
3 Fundamental I/O Operations and Bo
Page 40:
As Table 3.1 indicates, the multipl
Page 43 and 44:
26 Exploiting Locality and Load Bal
Page 45 and 46:
28 Exploiting Locality and Load Bal
Page 47 and 48:
30 External Sorting and Related Pro
Page 49 and 50:
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
Page 57 and 58:
Page 59 and 60:
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Page 74 and 75:
6 Lower Bounds on I/O In this chapt
Page 76 and 77:
6.1 Permuting 59 in backwards order
Page 78 and 79:
6.2 Lower Bounds for Sorting and Ot
Page 80:
6.2 Lower Bounds for Sorting and Ot
Page 83 and 84:
66 Matrix and Grid Computations the
Page 86 and 87:
8 Batched Problems in Computational
Page 88 and 89:
8.1 Distribution Sweep 71 Goodrich
Page 90 and 91:
8.1 Distribution Sweep 73 the curre
Page 92 and 93:
Time (seconds) Time (seconds) 7000
Page 94 and 95:
9 Batched Problems on Graphs The pr
Page 96 and 97:
Table 9.2 Best known I/O bounds for
Page 98 and 99:
9.2 Special Cases 81 that contains
Page 100 and 101:
10 External Hashing for Online Dict
Page 102 and 103:
2 000 000 001 010 011 100 101 110 1
Page 104 and 105:
10.2 Directoryless Methods 87 a tot
Page 106 and 107:
11 Multiway Tree Data Structures In
Page 108 and 109:
11.1 B-trees and Variants 91 “sha
Page 110 and 111:
11.3 Parent Pointers and Level-Bala
Page 112 and 113:
11.4 Buffer Trees 95 I/Os by follow
Page 114:
11.4 Buffer Trees 97 between update
Page 117 and 118:
100 Spatial Data Structures and Ran
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
Page 133 and 134:
Page 136 and 137:
13 Dynamic and Kinetic Data Structu
Page 138 and 139:
13.2 Continuously Moving Items 121
Page 140 and 141: 14 String Processing In this chapte
Page 142 and 143: 5 a b a 3 c a 0 b a 4 b 6 6 a b a b
Page 144 and 145: 14.3 Suffix Trees and Suffix Arrays
Page 146 and 147: 15 Compressed Data Structures The f
Page 148 and 149: 15.1 Data Representations and Compr
Page 150 and 151: 15.2 External Memory Compressed Dat
Page 152 and 153: 15.2 External Memory Compressed Dat
Page 154: 15.2 External Memory Compressed Dat
Page 157 and 158: 140 Dynamic Memory Allocation For s
Page 159 and 160: 142 External Memory Programming Env
Page 161 and 162: 144 External Memory Programming Env
Page 163 and 164: 146 Conclusions intriguing connecti
Page 165 and 166: 148 Notations and Acronyms lowercas
Page 167 and 168: 150 Notations and Acronyms � �
Page 169 and 170: 152 References Proceedings of the A
Page 171 and 172: 154 References [41] L. Arge, K. H.
Page 173 and 174: 156 References Computer Science, pp
Page 175 and 176: 158 References ACM Conference on In
Page 177 and 178: 160 References [132] F. K. H. A. De
Page 179 and 180: 162 References [165] R. W. Floyd,
Page 181 and 182: 164 References [195] M. R. Henzinge
Page 183 and 184: 166 References [228] K. Küspert,
Page 185 and 186: 168 References [261] D. R. Morrison
Page 187 and 188: 170 References [293] J. T. Robinson
Page 189: 172 References [325] “TerraServer
show all

Algorithms and Data Structures for External Memory

Create successful ePaper yourself

Delete template?

Save as template?