1. Gerth Stølting Brodal, Konstantinos Tsakalidis, Spyros Sioutas, Kostas Tsichlas: Fully persistent b-trees



Download 13.85 Kb.
Date16.07.2017
Size13.85 Kb.
#23407
ΔΙΑΧΕΙΡIΣΗ ΜΕΓΑΛΟΥ ΟΓΚΟΥ ΔΕΔΟΜΕΝΩΝ

27 ΑΠΡΙΛΙΟΥ 2017

1. Gerth Stølting Brodal, Konstantinos Tsakalidis, Spyros Sioutas, Kostas Tsichlas: Fully persistent B-trees. SODA 2012: 602-614, Κουνέλης Φώτιος

2. B. Becker, S. Gschwind, T. Ohler, B. Seeger, P. Widmayer, An asymptotically optimal multiversion B-tree, The VLDB Journal, 264-275., Μπάρλος Παναγιώτης

3. Data mining using high performance data clouds: experimental studies using sector and sphere, Παπαχρήστος Νικόλαος


4 ΜΑΙΟΥ 2017

4. Kanellakis, P. C.,Ramaswamy, S., Vengroff, D. E., and Vitter, J. S. 1996. Indexing for data models with constraints and classes. Journal of Computer and System Sciences 52, 3, 589-612., Μίχα Παρασκευή.

5. Foundations of Multidimensional and Metric Data Structures - Mulτidimensional Point Data (Quadtrees, k-d trees, Grid Directory, PK-trees), Τσακτσήρας Ιωάννης

6. Arge, L., Samoladas, V., and Vitter, J. S. 1999b TWO-DIMENSIONAL

INDEXABILITY AND OPTIMAL RANGE SEARCH INDEXING, Σεργιάννης Γεώργιος
11 ΜΑΙΟΥ 2017

7. Intervals and small rectangles, Δημοπούλου Μερκουρία

8. Lars Arge, Mikkel Thorup: RAM-Efficient External Memory Sorting., Μάλλας

9. Lars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava, On (Dynamic) Range Minimum Queries in ExternalMemory. WADS 2013: 37-48R, Φλογερα

10. M. A. Bender, E. Demaine, and M. Farach-Colton."Cache Oblivious B-Trees" Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS), pages 399-409, 2000, σπυρος καλογιάννης
18 ΜΑΙΟΥ 2017

11. Ηigh dimensional data, Χρηστίδη αγγελική μαρία

12. Rahul Shah, Cheng Sheng, Sharma V. Thankachan, Jeffrey Scott Vitter, Top-k Document Retrieval in External Memory. ESA 2013: 803-81

Σταυρούλα Ειρήνη Καρανάσιου

13. Vitter, J. S. and Shriver, E. 1994a. Algorithms for parallel memory I: Two-level memories. Algorithmica 12, 2-3, 110-147, Kούβελας


25 ΜΑΙΟΥ 2017

14. Grossman, R. and Y. Gu (2008). Data mining using high performance data clouds: experimental studies using sector and sphere. Χαρης Δημητροπουλος

15. Wang, J., S. Wu, H. Gao, J. Li, and B. C. Ooi (2010). Indexing multi-dimensional data n a cloud system. In Proceedings of the 2010 international conference on Management of data, SIGMOD '10, New York, NY, USA, pp. 591{602. ACM. Περγαντής Δημήτρης

16. Efficient B-tree Based Indexing for Cloud Data Processing Χριστίνα Σπυροπουλου



1 ΙΟΥΝΙΟΥ 2017

17. Lars Arge, Michael T. Goodrich, Freek van Walderveen, Computing betweenness centrality in external memory. BigData Conference 2013: 368-375, Τσίρτσι Αργυρω



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. Lars Arge, Mikkel Thorup: RAM-Efficient External Memory Sorting. CoRR abs/1312.2018 (2013) 2012 Μαλλάς


8 ΙΟΥΝΙΟΥ 2017

20. Pankaj K. Agarwal, Lars Arge, Sathish Govindarajan, Jun Yang, Ke Yi, Efficient external memory structures for range-aggregate queries. Comput. Geom. 46(3): 358-370 (2013) Μπομποτας

21. S. Lanka, E. Mays, Fully Persistent B+-trees, ACM International Conference on Management of Data, 426-435, 1992. Πετρόπουλος
15 ΙΟΥΝΙΟΥ 2017
22. Object based and image based image representations, Συριανίδης

23. 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.



Xριστίνα καραμπέρη

Download 13.85 Kb.

Share with your friends:




The database is protected by copyright ©ininet.org 2022
send message

    Main page