default search action
31st PODS 2012: Scottsdale, AZ, USA
- Michael Benedikt, Markus Krötzsch, Maurizio Lenzerini:
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2012, Scottsdale, AZ, USA, May 20-24, 2012. ACM 2012, ISBN 978-1-4503-1248-6
Opening and keynote address
- Surajit Chaudhuri:
What next?: a half-dozen data management research goals for big data and the cloud. 1-4
Streaming
- Kook Jin Ahn, Sudipto Guha, Andrew McGregor:
Graph sketches: sparsification, spanners, and subgraphs. 5-14 - Piotr Indyk, Reut Levi, Ronitt Rubinfeld:
Approximating and testing k-histogram distributions in sub-linear time. 15-22 - Pankaj K. Agarwal, Graham Cormode
, Zengfeng Huang
Mergeable summaries. 23-34
Awards session
- Richard Hull, Phokion G. Kolaitis, Dirk Van Gucht:
The ACM PODS Alberto O. Mendelzon test-of-time award 2012. 35-36 - Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra:
Worst-case optimal join algorithms: [extended abstract]. 37-48 - Benoît Groz, Sebastian Maneth, Slawek Staworko
Deterministic regular expressions in linear time. 49-60
Tutorial Session
- Benjamin C. Pierce:
Linguistic foundations for bidirectional transformations: invited tutorial. 61-64
Privacy and semantic web
- Krzysztof Choromanski, Tal Malkin:
The power of the dinur-nissim algorithm: breaking privacy of statistical and graph databases. 65-76 - Daniel Kifer, Ashwin Machanavajjhala:
A rigorous and customizable framework for privacy. 77-88 - Andrés Letelier, Jorge Pérez, Reinhard Pichler, Sebastian Skritek
Static analysis and optimization of semantic web queries. 89-100 - Katja Losemann, Wim Martens:
The complexity of evaluating path expressions in SPARQL. 101-112
Range queries
- Yakov Nekrich
Space-efficient range reporting for categorical data. 113-120 - Cheng Sheng, Yufei Tao
Dynamic top-k range reporting in external memory. 121-130 - Yufei Tao
Indexability of 2D range search revisited: constant redundancy and weak indivisibility. 131-142
Tutorial session 2
- Michael W. Mahoney:
Approximate computation and implicit regularization for very large-scale data analysis. 143-154 - Allan Borodin, Hyun Chul Lee, Yuli Ye:
Max-Sum diversification, monotone submodular functions and dynamic updates. 155-166
Views and data exchange
- Paraschos Koutris, Prasang Upadhyaya, Magdalena Balazinska, Bill Howe
Query-based data pricing. 167-178 - Ronald Fagin, Phokion G. Kolaitis:
Local transformations and conjunctive-query equivalence. 179-190 - Benny Kimelfeld:
A dichotomy in the complexity of deletion propagation with functional dependencies. 191-202
Indexing
- Roberto Grossi, Giuseppe Ottaviano:
The wavelet trie: maintaining an indexed sequence of strings in compressed space. 203-214 - Pan Xu, Srikanta Tirthapura
On the optimality of clustering properties of space filling curves. 215-224 - Pankaj K. Agarwal, Alon Efrat
Nearest-neighbor searching under uncertainty. 225-236
Query languages
- Egor V. Kostylev
Classification of annotation semirings over query containment. 237-248 - Pablo Barceló
Efficient approximations of conjunctive queries. 249-260 - Ting Deng, Wenfei Fan
On the complexity of package recommendation problems. 261-272
Streaming and aggregation
- Andrew McGregor, A. Pavan
Space-efficient estimation of statistics over sub-sampled streams. 273-282 - Srikanta Tirthapura
Rectangle-efficient aggregation in spatial data streams. 283-294 - Zengfeng Huang
Randomized algorithms for tracking distributed count, frequencies, and ranks. 295-306 - Zhenming Liu, Bozidar Radunovic, Milan Vojnovic:
Continuous distributed counting for non-monotonic streams. 307-318
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-26 23:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: