Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Volume 43, Issue 1March 2018Best of SIGMOD 2016 Papers and Regular Papers
Reflects downloads up to 25 Jan 2025Bibliometrics
Skip Table Of Content Section
editorial
Free
Editorial: Updates to the Editorial Board
Article No.: 1, Page 1https://doi.org/10.1145/3183376
SECTION: Best of SIGMOD 2016 Papers
research-article
Public Access
Practical Private Range Search in Depth
Article No.: 2, Pages 1–52https://doi.org/10.1145/3167971

We consider a data owner that outsources its dataset to an untrusted server. The owner wishes to enable the server to answer range queries on a single attribute, without compromising the privacy of the data and the queries. There are several schemes on “...

research-article
Estimating the Impact of Unknown Unknowns on Aggregate Query Results
Article No.: 3, Pages 1–37https://doi.org/10.1145/3167970

It is common practice for data scientists to acquire and integrate disparate data sources to achieve higher quality results. But even with a perfectly cleaned and merged data set, two fundamental questions remain: (1) Is the integrated data set complete?...

SECTION: Regular Papers
research-article
Building Efficient Query Engines in a High-Level Language
Article No.: 4, Pages 1–45https://doi.org/10.1145/3183653

Abstraction without regret refers to the vision of using high-level programming languages for systems development without experiencing a negative impact on performance. A database system designed according to this vision offers both increased ...

research-article
TriAL: A Navigational Algebra for RDF Triplestores
Article No.: 5, Pages 1–46https://doi.org/10.1145/3154385

Navigational queries over RDF data are viewed as one of the main applications of graph query languages, and yet the standard model of graph databases—essentially labeled graphs—is different from the triples-based model of RDF. While encodings of RDF ...

research-article
Bounded Query Rewriting Using Views
Article No.: 6, Pages 1–46https://doi.org/10.1145/3183673

A query Q in a language L has a bounded rewriting using a set of L-definable views if there exists a query Q in L such that given any dataset D, Q(D) can be computed by Q that accesses only cached views and a small fraction DQ of D. We consider ...

Subjects

Comments