Abstract is missing.
- Datalog redux: experience and conjectureJoseph M. Hellerstein. 1-2 [doi]
- Expressive languages for path queries over graph-structured dataPablo Barceló, Carlos A. Hurtado, Leonid Libkin, Peter T. Wood. 3-14 [doi]
- Transducing Markov sequencesBenny Kimelfeld, Christopher Ré. 15-26 [doi]
- Positive higher-order queriesMichael Benedikt, Gabriele Puppis, Huy Vu. 27-38 [doi]
- The ACM PODS Alberto O. Mendelzon test-of-time-award 2010Jianwen Su, Phokion G. Kolaitis. 39-40 [doi]
- An optimal algorithm for the distinct elements problemDaniel M. Kane, Jelani Nelson, David P. Woodruff. 41-52 [doi]
- Understanding cardinality estimation using entropy maximizationChristopher Ré, Dan Suciu. 53-64 [doi]
- From information to knowledge: harvesting entities and relationships from web sourcesGerhard Weikum, Martin Theobald. 65-76 [doi]
- Optimal sampling from distributed streamsGraham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang. 77-86 [doi]
- Fast Manhattan sketches in data streamsJelani Nelson, David P. Woodruff. 99-110 [doi]
- Semantic query optimization in the presence of typesMichael Meier 0002, Michael Schmidt, Fang Wei, Georg Lausen. 111-122 [doi]
- Optimizing linear counting queries under differential privacyChao Li, Michael Hay, Vibhor Rastogi, Gerome Miklau, Andrew McGregor. 123-134 [doi]
- Universally optimal privacy mechanisms for minimax agentsMangesh Gupte, Mukund Sundararajan. 135-146 [doi]
- Towards an axiomatization of statistical privacy and utilityDaniel Kifer, Bing-Rong Lin. 147-158 [doi]
- Information complexity: a tutorialT. S. Jayram. 159-168 [doi]
- Capturing missing tuples and missing valuesWenfei Fan, Floris Geerts. 169-178 [doi]
- On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databasesJef Wijsen. 179-190 [doi]
- Certain answers for XML queriesClaire David, Leonid Libkin, Filip Murlak. 191-202 [doi]
- Computing query probability with incidence algebrasNilesh N. Dalvi, Karl Schnaitter, Dan Suciu. 203-214 [doi]
- On probabilistic fixpoint and Markov chain query languagesDaniel Deutch, Christoph Koch, Tova Milo. 215-226 [doi]
- Foundations of schema mapping managementMarcelo Arenas, Jorge Pérez, Juan L. Reutter, Cristian Riveros. 227-238 [doi]
- Schema design for XML repositories: complexity and tractabilityWim Martens, Matthias Niewerth, Thomas Schwentick. 239-250 [doi]
- Simplifying XML schema: single-type approximations of regular tree languagesWouter Gelade, Tomasz Idziaszek, Wim Martens, Frank Neven. 251-260 [doi]
- Characterizing schema mappings via data examplesBogdan Alexe, Phokion G. Kolaitis, Wang Chiew Tan. 261-272 [doi]
- Understanding queries in a search database systemRonald Fagin, Benny Kimelfeld, Yunyao Li, Sriram Raghavan, Shivakumar Vaithyanathan. 273-284 [doi]
- A learning algorithm for top-down XML transformationsAurélien Lemay, Sebastian Maneth, Joachim Niehren. 285-296 [doi]
- Cache-oblivious hashingRasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang. 297-304 [doi]
- Performance guarantees for B-trees with different-sized atomic keysMichael A. Bender, Haodong Hu, Bradley C. Kuszmaul. 305-316 [doi]
- When data dependencies over SQL tables meet the logics of paradox and S-3Sven Hartmann, Sebastian Link. 317-326 [doi]
- The power of tree projections: local consistency, greedy algorithms, and larger islands of tractabilityGianluigi Greco, Francesco Scarcello. 327-338 [doi]