
PODS 2012: Accepted Papers
- Yufei Tao: 2D Orthogonal Range Search Revisited: Indexability with Redundancy
- Srikanta Tirthapura and David Woodruff: Rectangle-efficient Aggregation in Spatial Data Streams
- Roberto Grossi and Giuseppe Ottaviano: The Wavelet Trie: Maintaining an Indexed Sequence of Strings in Compressed Space
- Kook Jin Ahn, Sudipto Guha, and Andrew Mcgregor: Graph Sketching: Sparsification, Spanners, and Subgraphs
- Katja Loseman and Wim Martens: The Complexity of Evaluating Path Expressions in SPARQL
- Benny Kimelfeld: A Dichotomy in the Complexity of Deletion Propagation with Functional Dependencies
- Ronald Fagin and Phokion Kolaitis: Local Transformations and Conjunctive-Query Equivalence
- Pankaj K. Agarwal, Alon Efrat, Swaminathan Sankararman, and Wuzhou Zhang: Nearest-neighbor Searching under Uncertainty
- Zengfeng Huang, Ke Yi, and Qin Zhang: Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks
- Hung Ngo, Ely Porat, Christopher Re, and Atri Rudra: Worst-case Optimal Join Algorithms
- Zhenming Liu, Bozidar Radunovic, and Milan Vojnovic: Continuous Distributed Counting for Non-monotonic streams
- Pan Xu and Srikanta Tirthapura: On Optimality of Clustering Through a Space-Filling Curve
- Andrew Mcgregor, A. Pavan, Srikanta Tirthpura, and David Woodruff: Space-efficient Estimation of Statistics over Subsampled Streams
- Kzysztof Choromanski and Tal Malkin: The Power of the Dinur-Nissim Algorithm: breaking Privacy of Statistical and Graph Databases
- Cheng Sheng and Yufei Tao: Dynamic Top-K Range Reporting in External Memory
- Andres Letelier, Jorge Perez, Reinhard Pichler, and Sebastian Skritek: Static Analyis and Optimization of Semantic Web Queries
- Allan Borodin, Hyun Chul Lee, and Yuli Ye: Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates
- Daniel Kifer and Ashwin Machanavajjhala: A Rigorous and Customizable Framework for Privacy
- Paraschos Koutris, Prasan Upadhyaya, Magdalena Balazinska, Bill Howe, and Dan Suciu: Query-Based Data Pricing
- Yakov Nekrich: Space-efficient Range Reporting for Categorical Data
- Piotr Indyk, Ronitt Rubinfeld, and Reut Levi: Approximating and Testing k-Histogram Distributions in Sub-linear Time
- Ting Deng, Wenfei Fan, and Floris Geerts: On the Complexity of Package Recommendation Problems
- Egor V. Kostylev, Juan L. Reutter, and Andras Salamon: Classification of Annotation Semirings over Query Containment
- Pablo Barcelo, Leonid Libkin, and Miguel Romero: Efficient Approximations of Conjunctive Queries
- Pankaj Agarwal, Graham Cormode, Zengfeng Huang, Jeff Phillips, Zheiwei Wei and Ke Yi: Mergeable Summaries
- Benoit Groz, Sebastian Maneth, and Slawek Staworko: Deterministic Regular Expressions in Linear Time