SIGMOD Best Papers CollectingThe ACM Special Interest Group on Management of Data is concerned with the principles, techniques and applications of database management systems and data management technology. Our members include software developers, academic and industrial researchers, practitioners, users, and students. SIGMOD sponsors the annual SIGMOD/PODS conference, one of the most important and selective in the field.
Proceedings of the 2019 International Conference on Management of Data, pp.793-810, (2019)
Fairness is increasingly recognized as a critical component of machine learning systems. However, it is the underlying data on which these systems are trained that often reflect discrimination, suggesting a database repair problem. Existing treatments of fairness rely on statisti...
Cited by25BibtexViews75Links
0
0
SIGMOD/PODS '18: International Conference on Management of Data Houston TX U..., pp.323-336, (2018)
We present the Succinct Range Filter (SuRF), a fast and compact data structure for approximate membership tests. Unlike traditional Bloom filters, SuRF supports both single-key lookups and common range queries: open-range queries, closed-range queries, and range counts. SuRF is b...
Cited by40BibtexViews146Links
0
0
SIGMOD Conference, no. 4 (2017): 495-510
GRAPE parallelization guarantees to terminate with correct answers under a monotonic condition if the sequential algorithms are correct
Cited by46BibtexViews88Links
0
0
Feifei Li, Bin Wu,Ke Yi, Zhuoyue Zhao
SIGMOD/PODS'16: International Conference on Management of Data San Francisco Califor..., pp.615-629, (2016)
We have evaluated the performance of wander join in comparison with ripple join and its variants, the DBO engine, under two settings, which are described in detail below
Cited by76BibtexViews49Links
0
0
ACM SIGMOD Conference, pp.519-530, (2015)
DBSCAN is a creative, elegant, and effective technique for density-based clustering, which is very extensively applied in data mining, machine learning, and databases
Cited by139BibtexViews76Links
0
0
ACM Trans. Database Syst., no. 1 (2014)
Analytics is one of the biggest topics in data management, and feature selection is widely regarded as the most critical step of analytics; we argue that managing the feature selection process is a pressing data management challenge
Cited by127BibtexViews49Links
0
0
SIGMOD Conference, pp.325-336, (2013)
Graph Partition O |E |2/(MB) + K /B I/Os where K triangles In practice, M > |E | If M = c|E |, asymptotically optimal But under a set of assumptions
Cited by86BibtexViews58Links
0
0
SIGMOD Conference, pp.253-264, (2012)
Much research attention has been given to delivering high-performance systems that are capable of complex event processing (CEP) in a wide range of applications. However, many current CEP systems focus on processing efficiently data having a simple structure, and are otherwise li...
Cited by58BibtexViews74Links
0
0
ACM Transactions on Database Systems (TODS), no. 3 (2011): ArticleNo.21-ArticleNo.21
Many data-driven social and Web applications involve collaboration and coordination. The vision of declarative data-driven coordination (D3C), proposed in [9], is to support coordination in the spirit of data management: to make it data-centric and to specify it using convenient ...
Cited by19BibtexViews86Links
0
0
SIGMOD Conference, pp.339-350, (2010)
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vector units. There has been much work to exploit modern processor architectures for database primitives ...
Cited by298BibtexViews89Links
0
0
SIGMOD Conference, pp.245-256, (2009)
While developing data-centric programs, users often run (portions of) their programs over real data, to see how they behave and what the output looks like. Doing so makes it easier to formulate, understand and compose programs correctly, compared with examination of program logic...
Cited by65BibtexViews59Links
0
0
SIGMOD Conference, pp.43-54, (2008)
An algorithm is presented for finding the k nearest neighbors in a spatial network in a best-first manner using network distance. The algorithm is based on precomputing the shortest paths between all possible vertices in the network and then making use of an encoding that takes a...
Cited by303BibtexViews49Links
0
0
ACM Trans. Database Syst., no. 4 (2008): 729-738
Many popular database management systems implement a multiversion concurrency control algorithm called snapshot isolation rather than providing full serializability based on locking. There are well-known anomalies permitted by snapshot isolation that can lead to violations of dat...
Cited by228BibtexViews54Links
0
0
ACM Transactions on Database Systems (TODS), no. 4 (2008): ArticleNo.23-ArticleNo.23
This paper describes query processing in the DBO database sys- tem. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to queries over a large relational database in a scalable fashion. Unlike any other system designed fo...
Cited by140BibtexViews46Links
0
0
ACM Transactions on Database Systems (TODS), no. 4 (2007): ArticleNo.22-ArticleNo.22
Translating data and data access operations between applications and databases is a longstanding data management problem. We present a novel approach to this problem, in which the relationship between the application data and the persistent storage is specified using a declarativ...
Cited by81BibtexViews51Links
0
0
SIGMOD Conference, pp.265-276, (2006)
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive structured relations from unstructured text; as another example, focused crawlers explore the web to...
Cited by101BibtexViews61Links
0
0
SIGMOD Conference, pp.599-610, (2004)
In this paper, we attempt to approximate and index a d- dimensional (d ≥ 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose the polynomial, including (continuous)Fourier transforms, splines, non-linear regressino, etc. Som...
Cited by373BibtexViews69Links
0
0
SIGMOD Conference, pp.52-63, (2003)
One of the critical deficiencies of SQL is lack of support for n-dimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications have to emulate them using joins, recently introduced SQL Window Functions [18] and complex and inef...
Cited by100BibtexViews49Links
0
0
ACM Transactions on Database Systems (TODS), no. 2 (2001): 188-228
The main contribution of this paper is to show that a simple, novel dimensionality reduction technique, namely Adaptive Piecewise Constant Approximation, can outperform more sophisticated transforms by one to two orders of magnitude
Cited by1048BibtexViews101Links
0
0
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data, no. 2-3 (2000): 343-354
We considered two categories of SQL implementations
Cited by568BibtexViews125Links
0
0
Keywords
Database SystemIndexationQuery OptimizationUser Defined FunctionsData AccessData ExchangeData ManagementDesignEuclidean DistanceFourier Transform
Authors
Dan Suciu
Paper 2
Yufei Tao
Paper 2
Venky Harinarayan
Paper 1
Viktor Leis
Paper 1
Phil Bernstein
Paper 1
Abhijit Pol
Paper 1
Anthony D. Nguyen
Paper 1
Hyeontaek Lim
Paper 1
Utkarsh Srivastava
Paper 1