Issue Downloads
Practical Private Range Search in Depth
- Ioannis Demertzis,
- Stavros Papadopoulos,
- Odysseas Papapetrou,
- Antonios Deligiannakis,
- Minos Garofalakis,
- Charalampos Papamanthou
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 “...
Estimating the Impact of Unknown Unknowns on Aggregate Query Results
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?...
Building Efficient Query Engines in a High-Level Language
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 ...
TriAL: A Navigational Algebra for RDF Triplestores
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 ...
Bounded Query Rewriting Using Views
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 ...