Data management, non-theory, level-0
1D Data
[KBC+18] Tim Kraska, Alex Beutel, Ed H. Chi, Jeffrey Dean, Neoklis Polyzotis: The Case for Learned Index Structures. SIGMOD Conference 2018: 489-504.
Multidimensional data (small dimensionalities)
Indexing
[BKSS90] Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD Conference 1990: 322-331.
[PSTW93] Bernd-Uwe Pagel, Hans-Werner Six, Heinrich Toben, Peter Widmayer: Towards an Analysis of Range Query Performance in Spatial Data Structures. PODS 1993: 214-221.
[KF94] Ibrahim Kamel, Christos Faloutsos: Hilbert R-tree: An Improved R-tree using Fractals. VLDB 1994: 500-509.
Nearest neighbor search
[RKV95] Nick Roussopoulos, Stephen Kelley, Fredeic Vincent: Nearest Neighbor Queries. SIGMOD Conference 1995: 71-79.
[HS99] Gisli R. Hjaltason, Hanan Samet: Distance Browsing in Spatial Databases. ACM Trans. Database Syst. 24(2): 265-318 (1999).
Reverse nearest neighbor search
[KM00] Flip Korn, S. Muthukrishnan: Influence Sets Based on Reverse Nearest Neighbor Queries. SIGMOD Conference 2000: 201-212.
Skylines (maxima)
[PTFS05] Dimitris Papadias, Yufei Tao, Greg Fu, Bernhard Seeger: Progressive skyline computation in database systems. ACM Trans. Database Syst. 30(1): 41-82 (2005).
Top-k
[FLN03] Ronald Fagin, Amnon Lotem, Moni Naor: Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci. 66(4): 614-656 (2003).
[IBS08] Ihab F. Ilyas, George Beskales, Mohamed A. Soliman:
A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv. 40(4): 11:1-11:58 (2008).
Moving objects
[SJLL00] Simonas Saltenis, Christian S. Jensen, Scott T. Leutenegger, Mario Alberto Lopez: Indexing the Positions of Continuously Moving Objects. SIGMOD Conference 2000: 331-342.
Uncertain data
[TXC07] Yufei Tao, Xiaokui Xiao, Reynold Cheng: Range search on multidimensional uncertain data. ACM Trans. Database Syst. 32(3): 15 (2007).
Probabilistic data
[CLY09] Graham Cormode, Feifei Li, Ke Yi: Semantics of Ranking Queries for Probabilistic Data and Expected Ranks. ICDE 2009: 305-316.
Temporal data
[BGO+96] Bruno Becker, Stephan Gschwind, Thomas Ohler, Bernhard Seeger, Peter Widmayer: An Asymptotically Optimal Multiversion B-Tree. VLDB J. 5(4): 264-275 (1996).
[ST99] Betty Salzberg, Vassilis J. Tsotras: Comparison of Access Methods for Time-Evolving Data. ACM Comput. Surv. 31(2): 158-221 (1999).
High-dimensional data
[BKK96] Stefan Berchtold, Daniel A. Keim, Hans-Peter Kriegel:
The X-tree : An Index Structure for High-Dimensional Data. VLDB 1996: 28-39.
[GIM99] Aristides Gionis, Piotr Indyk, Rajeev Motwani: Similarity Search in High Dimensions via Hashing. VLDB 1999: 518-529.
[JOT+05] H. V. Jagadish, Beng Chin Ooi, Kian-Lee Tan, Cui Yu, Rui Zhang: iDistance: An adaptive B+ -tree based indexing method for nearest neighbor search. ACM Trans. Database Syst. 30(2): 364-397 (2005).
OLAP
[GBLP96] Jim Gray, Adam Bosworth, Andrew Layman, Hamid Pirahesh: Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total. ICDE 1996: 152-159.
[BR99] Kevin S. Beyer, Raghu Ramakrishnan: Bottom-Up Computation of Sparse and Iceberg CUBEs. SIGMOD Conference 1999: 359-370.
Data mining
Assocition rules and frequent itemsets
[AS94] Rakesh Agrawal, Ramakrishnan Srikant: Fast Algorithms for Mining Association Rules in Large Databases. VLDB 1994: 487-499.
Clustering
[EKSX96] Martin Ester, Hans-Peter Kriegel, Jorg Sander, Xiaowei Xu: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. KDD 1996: 226-231.
[GT17] Junhao Gan, Yufei Tao: On the Hardness and Approximation of Euclidean DBSCAN. ACM Trans. Database Syst. 42(3): 14:1-14:45 (2017).
Outliers
[KN98] Edwin M. Knorr, Raymond T. Ng: Algorithms for Mining Distance-Based Outliers in Large Datasets. VLDB 1998: 392-403.
[BKNS00] Markus M. Breunig, Hans-Peter Kriegel, Raymond T. Ng, Jorg Sander: LOF: Identifying Density-Based Local Outliers. SIGMOD Conference 2000: 93-104.
Graphs
Influence maximization
[KKT03] David Kempe, Jon M. Kleinberg, Eva Tardos: Maximizing the spread of influence through a social network. KDD 2003: 137-146.
[BBCL14] Christian Borgs, Michael Brautbar, Jennifer T. Chayes, Brendan Lucier:
Maximizing Social Influence in Nearly Optimal Time. SODA 2014: 946-957.
Crowd sourcing
[TLL19] Yufei Tao, Yuanbing Li, Guoliang Li: Interactive Graph Search. SIGMOD Conference 2019: 1393-1410.
Massively parallel
[MAB+10] Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, Grzegorz Czajkowski:
Pregel: a system for large-scale graph processing. SIGMOD Conference 2010: 135-146.
[TLX13] Yufei Tao, Wenqing Lin, Xiaokui Xiao: Minimal MapReduce algorithms. SIGMOD Conference 2013: 529-540.
Distributed
Online tracking
[YZ12] Ke Yi, Qin Zhang:
Multidimensional online tracking. ACM Trans. Algorithms 8(2): 12:1-12:16 (2012).
Streams
Sampling
[BOZ09] Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniolo: Optimal sampling from sliding windows. PODS 2009: 147-156.