Γενικά:

1. MyLifeBits: A Personal Database for Everything. http://research.microsoft.com/en-us/projects/mylifebits/

2. The OceanStore Project. http://oceanstore.cs.berkeley.edu/ 3. Hadoop. http://hadoop.apache.org/core/

Δευτερεύουσα Μνήμη:

1. Vitter, J. S. and Shriver, E. Algorithms for parallel memory I: Two-level memories. Algorithmica 12(2-3):110-147, 1994.

2. Vitter, J. S. and Shriver, E. Algorithms for parallel memory II: Hierarchical multilevel. 12(2-3):148-169, 1994.

3. Varman P. & Verma R. An Efficient Multiversion Access Structure. IEEE Transactions on Knowledge and Data Engineering, 391-409, 1997.

4. K. Munagala and A. Ranade. I/O-complexity of graph algorithms. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 687-694, 1999.

5. P. Sanders , S. Egner and J. Korst. Fast concurrent access to parallel disks. Proceedings of the 11th annual ACM-SIAM symposium on Discrete algorithms, p.849-858, January 09-11, 2000.

6. S. Sen , S. Chatterjee and N. Dumir. Towards a theory of cache-efficient algorithms. Journal of the ACM (JACM), 49(6):828-858, November 2002.

7. Arge, L., Samoladas, V., and Vitter, J. S. Two-dimensional indexability and optimal range search indexing. In Proceedings of the ACM Conference on Principles of Database Systems (Philadelphia, May-June), Vol. 18, 346-357, 1999.

8. Kanellakis, P. C.,Ramaswamy, S., Vengroff, D. E., and Vitter, J. S. Indexing for data models with constraints and classes. Journal of Computer and System Sciences 52(3):589-612, 1996.

9. Arge, L. and Vahrenhold, J. I/O-efficient dynamic planar point location. In Proceedings of the ACM Symposium on Computational Geometry (June), Vol. 9, 191-200, 2000.

10. Arge, L. External-memory algorithms with applications in geographic information systems. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, eds, Algorithmic Foundations of GIS, Vol. 1340 of Lecture Notes in Computer Science, Springer-Verlag, 213-254, 1997.

11. David Hutchinson, Anil Maheshwari , Norbert Zeh, An external memory data structure for shortest path queries, Discrete Applied Mathematics, v.126 n.1, p.55-82, March 2003.

12. E. Gal and S. Toledo. Algorithms and data structures for flash memories. ACM Computing Surveys (CSUR), 37(2):138-163, 2005.

Από το βιβλίο Handbook of Massive Data Sets:

1. Broder and M. Henzinger. Algorithmic Aspects of Information Retrieval on the Web, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende.

2. M.Najork, A. Heydon, High Performance Web Crawling, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende.

3. W. Aiello, F. Chung, L. Lu, Random Evolution in Massive Graphs. Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende.

4. O. Goldreich, Property Testing in Massive Graphs, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende.

5. R. Baeza-Yates, A. Moffat, G. Navarro, Searching Large Text Collections, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende.

6. J. Dula, F. Lopez, Data Envelopment Analysis (DEA) in Massive Data Sets, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende.

7. P. Bradley, O. Mangasarian, D. Musicant, Optimization Methods in Massive Data Sets, in Massive Data Sets, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende.

8. F. Murtagh, Clustering in Massive Data Sets, in Massive Data Sets, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende.

9. M. Riedewald, D. Agrawal, A. Abbadi, Managing and Analyzing Massive Data Sets with Data Cubes, in Massive Data Sets, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende.

10. M. Goodchild, K. Clarke, Data Quality in Massive Data Sets in Massive Data Sets, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende.

11. T. Johnson, Data Warehousing, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende. 12. Q. Ma, M. Wang, J. Gatliker, Mining Biomolecular Data Using Background Knowledge and

Artificial Neural Networks, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende.

Αλφαριθμητικά στην Δευτερεύουσα Μνήμη:

1. Kangho Roh , Maxime Crochemore , Costas S. Iliopoulos , Kunsoo Park, External Memory Algorithms for String Problems, Fundamenta Informaticae, v.84 n.1, p.17-32, August 2008.

2. Jian Pei, Jiawei Han, Behzad Mortazavi-Asl, Jianyong Wang, Helen Pinto, Qiming Chen, Umeshwar Dayal, Meichun Hsu: Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach. IEEE Trans. Knowl. Data Eng. 16(11): 1424-1440, 2004.

3. A. Lachmann and M. Riedewald. Finding Relevant Patterns in Bursty Sequences. In Proc. of the VLDB Endowment (PVLDB), 1(1):78-89, 2008.

4. Wing-Kai Hon, Tak-Wah Lam, Rahul Shah, Siu-Lung Tam, and Jeffrey Scott Vitter. Cache-Oblivious Index for Approximate String Matching. In Proc. 18th Annual Symposium on Combinatorial Pattern Matching, volume 4580 of Lecture Notes in Computer Science, pages 40-51. Springer Verlag, Berlin, 2007.

5. Gerth Stolting Brodal and Rolf Fagerberg. Cache-Oblivious String Dictionaries. In Proc. of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 581-590, 2006.

6. Michael A. Bender, Martin Farach-Colton, and Bradley C. Kuszmaul. Cache-Oblivious String B-Trees. In Proc. 25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 233-242, 2006.

7. P. Ferragina and R. Grossi. The string B-tree: a new data structure for string search in external memory and its applications. J. ACM, 46(2):236-280, 1999.

8. Lars Arge , Paolo Ferragina , Roberto Grossi , Jeffrey Scott Vitter. On sorting strings in external memory (extended abstract), Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.540-548, May 04-06, 1997.

9. Valentina Ciriani , Paolo Ferragina , Fabrizio Luccio , S. Muthukrishnan. A data structure for a sequence of string accesses in external memory. ACM Transactions on Algorithms (TALG), 3(1), February 2007.

10. D.R. Clark and J.I. Munro. Efficient Suffix Trees on Secondary Storage. Proc. ACM-SIAM SODA 96, 383-391, 1996.

Συμπίεση:

1. Haibo Hu, Dik Lun Lee, Victor C. S. Lee. Distance indexing on road networks. Proceedings of the 32nd international conference on Very large data bases, Pages: 894 - 905, 2006.

2. Paolo Ferragina, Roberto Grossi, Ankur Gupta, Rahul Shah, and Jeffrey Scott Vitter. On searching compressed string collections cache-obliviously. In Proc. 27th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 181-190, 2008.

3. Paolo Ferragina , Rossano Venturini. Compressed permuterm index. Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, July 23-27, 2007.

4. Arash Farzan, J. Ian Munro. A Uniform Approach Towards Succinct Representation of Trees. SWAT, 173-184, 2008.

5. Ferragina, P., Giancarlo, R., and Manzini, G. The myriad virtues of wavelet trees. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP). 560—571, 2006.

P2P:

1. S. Wang, Q.H. Vu, B.C. Ooi, A.Tung, L. Xu. Skyframe: a framework for skyline query processing in peer-to-peer systems. VLDB Journal, 18:345-362, 2009.

2. M.F. Kaashoek and D.R. Karger. Koorde: A Simple Degree-Optimal Distributed Hash Table. In Peer-to-Peer Systems II, LNCS 2735, pp. 98-107, 2003.

3. T. Hayes, N. Rustagi, J. Saia, A. Trehan. The forgiving tree: a self-healing distributed data structure. PODC, pp. 203-212, 2008.

4. B. Leong, B. Liskov and E. D. Demaine. Epichord: Parallelizing the Chord Lookup Algorithm with Reactive Routing State Management. Proc. of the 12th Int. Conf. on Networks (ICON), 2004.

5. J. Buford, A. Brown, M. Kolberg. Exploiting parallelism in the design of peer-to-peer overlays. Computer Communications, 31:452-463, 2008.

6. du Mouza, C.; Litwin, W.; Rigaux, P. SD-Rtree: A Scalable Distributed Rtree. ICDE 2007, Page(s):296 – 305, 2007.

7. Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, and Robert E. Gruber. Bigtable: A Distributed Storage

System for Structured. Data.OSDI'06: Seventh Symposium on Operating System Design and Implementation, 2006.

8. Eduardo F. Nakamura, Antonio A. F. Loureiro, Alejandro C. Frery. Information fusion for wireless sensor networks: Methods, models, and classifications, ACM Computing Surveys (CSUR), 39(3), 2007.

9. Marcos K. Aguilera, Arif Merchant, Mehul Shah, Alistair Veitch and Christos Karamanolis, Sinfonia: a new paradigm for building scalable distributed systems, Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles, Pages: 159 - 174, 2007.

10. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A Scalable and Dynamic Emulation of the Butterfly. PODC 2002.

11. M.T. Goodrich, M.J. Nelson and J.Z. Sun. The rainbow skip graph: a fault-tolerant constant-degree distributed data structure. In Proceedings of the 17th annual ACM-SIAM symposium on Discrete algorithm, 384 – 393, 2006.

Ροές Δεδομένων:

1. P. Gibbons, S. Tirthapura. Distributed Streams Algorithms for Sliding Windows. Theory of Computing Systems, 37(3):457-478, 2004.

2. R.M. Karp, S. Shenker and C.H. Papadimitriou. A Simple Algorithm for Finding Frequent Elements in Streams and Bags, ACM Transactions on Database Systems, 28(1):51-55, 2003.

3. Gurmeet Singh Manku, Arvind Jain, Anish Das Sarma. Detecting near-duplicates for web crawling. Proceedings of the 16th international conference on World Wide Web, Pages: 141 - 150, 2007.

4. Frederick Reiss, Minos Garofalakis, Joseph M. Hellerstein. Compact histograms for hierarchical identifiers. Proceedings of the 32nd international conference on Very large data bases, Pages: 870 - 881, 2006.

5. Piotr Indyk. Algorithms for dynamic geometric problems over data streams. STOC, 373-380, 2004.

6. Graham Cormode, S. Muthukrishnan. An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55(1): 58-75, 2005.

7. Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin. One sketch for all: fast algorithms for compressed sensing. STOC, 237-246, 2007.

8. Cheqing Ji, Ke Yi, Lei Chen, Jeffrey Xu Yu, Xuemin Lin. Space-Efficient Synopses for Sliding-Window Top-k Queries on Uncertain Streams. p.301-312, 2008.

9. Nikos Sarkas, Gautam Das, Nick Koudas, Anthony K. H. Tung. Categorical Skylines for Streaming Data. SIGMOD, pp. 239-250, 2008.

10. Jagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, and Neil Immerman. Efficient Pattern Matching over Event Streams. SIGMOD, pp. 147-160, 2008.

11. Graham Cormode, Philip Korn and Srikanta Tirthapura. Time-Decaying Aggregates in Out-of-order Streams. SIGMOD, pp. 89-98,2008.

12. Pokrajac, D. Lazarevic, A. Latecki, L.J. Incremental Local Outlier Detection for Data Streams. In Proc. of Computational Intelligence and Data Mining (CIDM), pp. 504-515, 2007.

Μοντέλο Cache Oblivious:

1. Cache-Aware and Cache-Oblivious Adaptive Sorting. Gerth Stolting Brodal, Rolf Fagerberg, and Gabriel Moruz. In Proc. 32nd International Colloquium on Automata, Languages, and Programming, volume 3580 of Lecture Notes in Computer Science, pages 576-588. Springer Verlag, Berlin, 2005.

2. Engineering a Cache-Oblivious Sorting Algorithm. Gerth Stolting Brodal, Rolf Fagerberg, and Kristoffer Vinther. In ACM Journal of Experimental Algorithmics, Special Issue of ALENEX 2004, volume 12(Article No. 2.2), 23 pages, 2007.

3. A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation. Richard E. Ladner, Ray Fortna, and Bao-Hoang Nguyen. Experimental Algorithmics, volume 2547 of Lecture Notes in Computer Science, pages 78-92. Springer Verlag, Berlin, 2002.

4. A Locality-Preserving Cache-Oblivious Dynamic Dictionary. Michael A. Bender, Ziyang Duan, John Iacono, and Jing Wu. J. Algorithms 53(2): 115-136 (2004).

5. Cache-Oblivious Search Trees via Trees of Small Height. Gerth Stolting Brodal, Rolf Fagerberg, and Riko Jacob. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 39-48, 2002.

6. Exponential Structures for Efficient Cache-Oblivious Algorithms. Michael A. Bender, Richard Cole, and Rajeev Raman. In Proceedings of the 29th International Colloquium on Automata, Languages and Programming, Volume 2380 of Lecture Notes In Computer Science, pages 195-207. Springer Verlag, Berlin, 2002.

7. Concurrent Cache-Oblivious B-Trees. Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, and Bradley C. Kuszmaul. In Proc. 27th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 228-237, 2005.

8. Cache-Oblivious Streaming B-Trees. Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, and Jelani Nelson. In Proc. 29th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 81-92, 2007.

9. Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. Michael A. Bender, Richard Cole, Erik D. Demaine, and Martin Farach-Colton. In Proceedings of the 10th Annual European Symposium on Algorithms, volume 2461 of Lecture Notes in Computer Science, pages 139-151, Rome, Italy, September 2002.

10. An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms. Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, and J. Ian Munro. SIAM Journal of Computing 36(6): 1672-1695, 2007.

11. Funnel Heap - A Cache Oblivious Priority Queue. Gerth Stolting Brodal and Rolf Fagerberg. In Proc. 13th Annual International Symposium on Algorithms and Computation, volume 2518 of Lecture Notes in Computer Science, pages 219-228. Springer Verlag, Berlin, 2002.

12. Optimal Cache-Oblivious Implicit Dictionaries. Gianni Franceschini and Roberto Grossi. In Proc. 30th International Colloquium on Automata, Languages, and Programming, volume 2719 of Lecture Notes in Computer Science, pages 316-331. Springer Verlag, Berlin, 2003.

13. Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees. Gianni Franceschini and Roberto Grossi. In Proc. 8th International Workshop on Algorithms and Data Structures, volume 2748 of Lecture Notes in Computer Science, pages 114-126. Springer Verlag, Berlin, 2003.

14. Cache-Oblivious Planar Shortest Paths. Hema Jampala and Norbert Zeh. In Proc. 32nd International Colloquium on Automata, Languages, and Programming, volume 3580 of Lecture Notes in Computer Science, pages 563-575. Springer Verlag, Berlin, 2005.

15. A Faster Cache-Oblivious Shortest-Path Algorithm for Undirected Graphs with Bounded Edge Lengths. Luca Allulli, Peter Lichodzijewski, and Norbert Zeh. In Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 910-919, 2007

16. Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. Gerth Stolting Brodal, Rolf Fagerberg, Ulrich Meyer, and Norbert Zeh. In Proc. 9th Scandinavian Workshop on Algorithm Theory, volume 3111 of Lecture Notes in Computer Science, pages 480-492. Springer Verlag, Berlin, 2004.

17. Cache-Oblivious Shortest Paths in Graphs Using Buffer Heap. Rezaul Alam Chowdhury and Vijaya Ramachandran. In Proc. 26th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 245-254, 2004

18. Gianni Franceschini, Roberto Grossi, J. Ian Munro, and Linda Pagli. Implicit B-trees: A New Data Structure for the Dictionary Problem. Journal of Computer and System Sciences, special issue of the 43th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2004.

19. Gianni Franceschini and Roberto Grossi. Implicit dictionaries supporting searches and amortized updates in O(log n loglog n). In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 670-678. SIAM, 2003.

20. Cache Oblivious Distribution Sweeping. Gerth Stolting Brodal and Rolf Fagerberg. In Proc. 29th International Colloquium on Automata, Languages, and Programming, volume 2380 of Lecture Notes in Computer Science, pages 426-438. Springer Verlag, Berlin, 2002.

21. Cache-Oblivious Data Structures for Orthogonal Range Searching. Pankaj K. Agarwal, Lars Arge, Andrew Danner, and Bryan Holland-Minkley. In Proc. 19th Annual ACM Symposium on Computational Geometry, pages 237-245, 2003.

22. Cache-Oblivious Planar Orthogonal Range Searching and Counting. Lars Arge, Gerth Stolting Brodal, Rolf Fagerberg, and Morten Laustsen. In Proc. 21st Annual ACM Symposium on Computational Geometry, pages 160-169, 2005.

23. Simple and Semi-Dynamic Structures for Cache-Oblivious Planar Orthogonal Range Searching. Lars Arge and Norbert Zeh. In Proc. 22nd Annual ACM Symposium on Computational Geometry, pages 158-166, 2006.

24. Cache-Oblivious R-Trees. Lars Arge, Mark de Berg, and Herman J. Haverkort. In Proc. 21st Annual ACM Symposium on Computational Geometry, pages 170-179, 2005.

25. Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull Peyman Afshani and Arash Farzan. In Proceedings of the 19th Annual Canadian Conference on Computational Geometry, pages 153-155, 2007.