Abstract is missing.
- What next?: a half-dozen data management research goals for big data and the cloudSurajit Chaudhuri. 1-4 [doi]
- Graph sketches: sparsification, spanners, and subgraphsKook Jin Ahn, Sudipto Guha, Andrew McGregor. 5-14 [doi]
- Approximating and testing k-histogram distributions in sub-linear timePiotr Indyk, Reut Levi, Ronitt Rubinfeld. 15-22 [doi]
- Mergeable summariesPankaj K. Agarwal, Graham Cormode, Zengfeng Huang, Jeff M. Phillips, Zhewei Wei, Ke Yi. 23-34 [doi]
- The ACM PODS Alberto O. Mendelzon test-of-time award 2012Richard Hull, Phokion G. Kolaitis, Dirk Van Gucht. 35-36 [doi]
- Worst-case optimal join algorithms: [extended abstract]Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra. 37-48 [doi]
- Deterministic regular expressions in linear timeBenoît Groz, Sebastian Maneth, Slawek Staworko. 49-60 [doi]
- Linguistic foundations for bidirectional transformations: invited tutorialBenjamin C. Pierce. 61-64 [doi]
- The power of the dinur-nissim algorithm: breaking privacy of statistical and graph databasesKrzysztof Choromanski, Tal Malkin. 65-76 [doi]
- A rigorous and customizable framework for privacyDaniel Kifer, Ashwin Machanavajjhala. 77-88 [doi]
- Static analysis and optimization of semantic web queriesAndrés Letelier, Jorge Pérez 0001, Reinhard Pichler, Sebastian Skritek. 89-100 [doi]
- The complexity of evaluating path expressions in SPARQLKatja Losemann, Wim Martens. 101-112 [doi]
- Space-efficient range reporting for categorical dataYakov Nekrich. 113-120 [doi]
- Dynamic top-k range reporting in external memoryCheng Sheng, Yufei Tao. 121-130 [doi]
- Indexability of 2D range search revisited: constant redundancy and weak indivisibilityYufei Tao. 131-142 [doi]
- Approximate computation and implicit regularization for very large-scale data analysisMichael W. Mahoney. 143-154 [doi]
- Max-Sum diversification, monotone submodular functions and dynamic updatesAllan Borodin, Hyun-Chul Lee, Yuli Ye. 155-166 [doi]
- Query-based data pricingParaschos Koutris, Prasang Upadhyaya, Magdalena Balazinska, Bill Howe, Dan Suciu. 167-178 [doi]
- Local transformations and conjunctive-query equivalenceRonald Fagin, Phokion G. Kolaitis. 179-190 [doi]
- A dichotomy in the complexity of deletion propagation with functional dependenciesBenny Kimelfeld. 191-202 [doi]
- The wavelet trie: maintaining an indexed sequence of strings in compressed spaceRoberto Grossi, Giuseppe Ottaviano. 203-214 [doi]
- On the optimality of clustering properties of space filling curvesPan Xu, Srikanta Tirthapura. 215-224 [doi]
- Nearest-neighbor searching under uncertaintyPankaj K. Agarwal, Alon Efrat, Swaminathan Sankararaman, Wuzhou Zhang. 225-236 [doi]
- Classification of annotation semirings over query containmentEgor V. Kostylev, Juan L. Reutter, András Z. Salamon. 237-248 [doi]
- Efficient approximations of conjunctive queriesPablo Barceló, Leonid Libkin, Miguel Romero 0001. 249-260 [doi]
- On the complexity of package recommendation problemsTing Deng, Wenfei Fan, Floris Geerts. 261-272 [doi]
- Space-efficient estimation of statistics over sub-sampled streamsAndrew McGregor, A. Pavan, Srikanta Tirthapura, David P. Woodruff. 273-282 [doi]
- Rectangle-efficient aggregation in spatial data streamsSrikanta Tirthapura, David P. Woodruff. 283-294 [doi]
- Randomized algorithms for tracking distributed count, frequencies, and ranksZengfeng Huang, Ke Yi, Qin Zhang. 295-306 [doi]
- Continuous distributed counting for non-monotonic streamsZhenming Liu, Bozidar Radunovic, Milan Vojnovic. 307-318 [doi]