Обработка и оптимизация запросов к базам данных
Информация
Данный список может быть расширен по мере необходимости.
Статья |
Дата |
Докладчик (Оппонент) |
|---|---|---|
| Yannis E. Ioannidis: Query Optimization. The Computer Science and Engineering Handbook 1997: 1038-1057 | 19.09 | Анастасия Рагозина |
| Donald Kossmann, Michael J. Franklin, Gerhard Drasch, and Wig Ag. 2000. Cache investment: integrating query optimization and distributed data placement. ACM Trans. Database Syst. 25, 4 (December 2000), 517-558. | 19.09 | Татьяна Чугаева |
| Donald Kossmann and Konrad Stocker. 2000. Iterative dynamic programming: a new class of query optimization algorithms. | 26.09 | Андрей Иванов |
| Fragkiskos Pentaris and Yannis Ioannidis. 2006. Query optimization in distributed networks of autonomous database systems. ACM Trans. Database Syst. 31, 2 (June 2006), 537-583. | 26.09 | Анастасия Рагозина |
| Douglas Comer. 1979. Ubiquitous B-Tree. ACM Comput. Surv. 11, 2 (June 1979), 121-137. | 10.10 | Татьяна Чугаева |
| Antonin Guttman. 1984. R-trees: a dynamic index structure for spatial searching. SIGMOD Rec.14, 2 (June 1984), 47-57. | 10.10 | Артем Вахрушев |
| Joseph M. Hellerstein, Jeffrey F. Naughton, and Avi Pfeffer. 1995. Generalized Search Trees for Database Systems. In Proceedings of the 21th International Conference on Very Large Data Bases(VLDB '95), Umeshwar Dayal, Peter M. D. Gray, and Shojiro Nishio (Eds.). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 562-573. | 10.10 | Анна Гудошникова |
| Ibrahim Kamel and Christos Faloutsos. 1994. Hilbert R-tree: An Improved R-tree using Fractals. InProceedings of the 20th International Conference on Very Large Data Bases (VLDB '94), Jorge B. Bocca, Matthias Jarke, and Carlo Zaniolo (Eds.). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 500-509. | 17.10 | Ксения Власова (Александр Кавокин) |
| Norbert Beckmann and Bernhard Seeger. 2009. A revised r*-tree in comparison with related index structures. In Proceedings of the 2009 ACM SIGMOD International Conference on Management of data (SIGMOD '09).ACM New York, NY, USA, 799-812. | 17.10 | Дмитрий Косатый |
| Paolo Ciaccia, Marco Patella, and Pavel Zezula. 1997. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB '97), Matthias Jarke, Michael J. Carey, Klaus R. Dittrich, Frederick H. Lochovsky, Pericles Loucopoulos, and Manfred A. Jeusfeld (Eds.). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 426-435. | 17.10 | Паша Зольников |
| Aristides Gionis, Piotr Indyk, and Rajeev Motwani. 1999. Similarity Search in High Dimensions via Hashing. In Proceedings of the 25th International Conference on Very Large Data Bases (VLDB '99), Malcolm P. Atkinson, Maria E. Orlowska, Patrick Valduriez, Stanley B. Zdonik, and Michael L. Brodie (Eds.). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 518-529. | 24.10 | Паша Зольников |
| J. Nievergelt, Hans Hinterberger, and Kenneth C. Sevcik. 1984. The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM Trans. Database Syst. 9, 1 (March 1984), 38-71. | 24.10 | Кирилл Скородумов |
| Burton H. Bloom. 1970. Space/time trade-offs in hash coding with allowable errors. Commun. ACM13, 7 (July 1970), 422-426. | 24.10 | Ксения Власова (Анастасия Бодрова) |
| M. V. Ramakrishna and P.-:1V Larson. 1989. File organization using composite perfect hashing.ACM Trans. Database Syst. 14, 2 (June 1989). | 31.10 | Данис Рахимзянов (Юлиан Сердюк) |
| Goetz Graefe and William J. McKenna. 1993. The Volcano Optimizer Generator: Extensibility and Efficient Search. | 31.10 | Александр Кавокин |
| Stefan Berchtold, Daniel A. Keim, and Hans-Peter Kriegel. 1996. The X-tree: An Index Structure for High-Dimensional Data. In Proceedings of the 22th International Conference on Very Large Data Bases (VLDB '96), T. M. Vijayaraman, Alejandro P. Buchmann, C. Mohan, and Nandlal L. Sarda (Eds.). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 28-39. | 07.11 | Анастасия Бодрова (Кирилл Скородумов) |
| Ibrahim Kamel and Christos Faloutsos. 1992. Parallel R-trees. SIGMOD Rec. 21, 2 (June 1992), 195-204. | 07.11 | Анна Гудошникова (Ирина Золотухина) |
| Jun Rao and Kenneth A. Ross. 2000. Making B+- trees cache conscious in main memory. SIGMOD Rec. 29, 2 (May 2000), 475-486. | 07.11 | Дмитрий Косатый (Александр Кавокин) |
| Hasso Plattner. 2009. A common database approach for OLTP and OLAP using an in-memory column database. In Proceedings of the 2009 ACM SIGMOD International Conference on Management of data (SIGMOD '09), Carsten Binnig and Benoit Dageville (Eds.). ACM, New York, NY, USA, 1-7. | 14.11 | Сергей Монькин (Александр Монькин) |
| Daniel Abadi, Samuel Madden, and Miguel Ferreira. 2006. Integrating compression and execution in column-oriented database systems. In Proceedings of the 2006 ACM SIGMOD international conference on Management of data (SIGMOD '06). ACM, New York, NY, USA, 671-682. | 14.11 | Мария Кокаия |
| Daniel J. Abadi, Samuel R. Madden, and Nabil Hachem. 2008. Column-stores vs. row-stores: how different are they really?. In Proceedings of the 2008 ACM SIGMOD international conference on Management of data (SIGMOD '08). ACM, New York, NY, USA, 967-980. | 14.11 | Юлиан Сердюк (Данис Рахимзянов) |
| Kemper, A. and Neumann, T. 2011. HyPer: A Hybrid OLTP&OLAP Main Memory Database System Based on Virtual Memory Snapshots. Proceedings of the 2011 IEEE 27th International Conference on Data Engineering (ICDE), 195-206. | 21.11 | Дмитрий Солдатов |
| Finkel, R.A. and Bentley, J.L. 1974. Quad trees a data structure for retrieval on composite keys. Acta Informatica 4, 2, 1-9. | 21.11 | Александр Монькин (Сергей Монькин) |
| Goetz Graefe and Harumi Kuno. 2010. Self-selecting, self-tuning, incrementally optimized indexes. In Proceedings of the 13th International Conference on Extending Database Technology (EDBT '10), USA, 371-381. | 21.11 | Андрей Иванов |
| Patrick O'Neil. 1992. The SB-tree: An Index-Sequential Structure for High-Performance Sequential Access. Acta Informatica, USA, 241-265. | 28.11 | Данис Рахимзянов |
| Patrick O'Neil, Edward Cheng, Dieter Gawlick and Elizabeth O'Neil. 1996. The log-structured merge-tree (LSM-tree). Acta Informatica, USA, 241-265. | 28.11 | Артем Вахрушев (Мария Кокаия) |
| Yandong Mao, Eddie Kohler, and Robert Tappan Morris. 2012. Cache craftiness for fast multicore key-value storage. In Proceedi cfngs of the 7th ACM european conference on Computer Systems(EuroSys '12). ACM, New York, NY, USA, 183-196. | 28.11 | Ирина Золотухина (Александр Монькин) |
| Benjamin Arai, Gautam Das, Dimitrios Gunopulos and Nick Koudas. 2007. Anytime measures for top-k algorithms. In Proceedings of the 33rd international conference on Very large data bases (VLDB'07), 914-925. | 5.12 | Юлиан Сердюк |
| Guoliang Li, Jian He, Dong Deng and Jian Li. 2015. Efficient Similarity Join and Search on Multi-Attribute Data. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of data (SIGMOD '15). ACM, New York, NY, USA, 1137-1151. | 5.12 | |
| Gang Qian, Qiang Zhu, Qiang Xue and Sakti Pramanik. 2006. Dynamic indexing for multidimensional non-ordered discrete data spaces using a data-partitioning approach. ACM Transactions on Database Systems (TODS). ACM New York, NY, USA, 439-484. | 5.12 | |
| Donald Kossmann. 2000. The state of the art in distributed query processing. ACM Computing Surveys (CSUR). ACM New York, NY, USA, 422-469. | 12.12 | Анастасия Бодрова |
| Iraklis Psaroudakis, Manos Athanassoulis, Matthaios Olma, and Anastasia Ailamaki. 2014. Reactive and proactive sharing across concurrent analytical queries. In Proceedings of the 2014 ACM SIGMOD international conference on Management of data (SIGMOD '14). ACM, New York, NY, USA, 889-892. | 12.12 | Мария Кокаия |
| S. Ramabhadran, S. Ratnasamy, J. M. Hellerstein, and S. Shenker. Prefix hash tree an indexing data structure over distributed hash tables. In Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing, St. John’s, Newfoundland, Canada, 2004. | 12.12 | Дмитрий Солдатов (Ирина Золотухина) |