Abstract is missing.
- Incomplete data: what went wrong, and how to fix itLeonid Libkin. 1-13 [doi]
- Expressive languages for querying the semantic webMarcelo Arenas, Georg Gottlob, Andreas Pieris. 14-26 [doi]
- Expressiveness of guarded existential rule languagesGeorg Gottlob, Sebastian Rudolph, Mantas Simkus. 27-38 [doi]
- Containment and equivalence of well-designed SPARQLReinhard Pichler, Sebastian Skritek. 39-50 [doi]
- On scale independence for querying big dataWenfei Fan, Floris Geerts, Leonid Libkin. 51-62 [doi]
- Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the calm-conjectureTom J. Ameloot, Bas Ketsman, Frank Neven, Daniel Zinn. 64-75 [doi]
- Model-data Ecosystems: challenges, tools, and trendsPeter J. Haas. 76-87 [doi]
- All-distances sketches, revisited: HIP estimators for massive graphs analysisEdith Cohen. 88-99 [doi]
- Composable core-sets for diversity and coverage maximizationPiotr Indyk, Sepideh Mahabadi, Mohammad Mahdian, Vahab S. Mirrokni. 100-108 [doi]
- Is min-wise hashing optimal for summarizing set intersection?Rasmus Pagh, Morten Stöckel, David P. Woodruff. 109-120 [doi]
- Enumerating answers to first-order queries over databases of low degreeArnaud Durand, Nicole Schweikardt, Luc Segoufin. 121-131 [doi]
- Counting solutions to conjunctive queries: structural and hybrid tractabilityGianluigi Greco, Francesco Scarcello. 132-143 [doi]
- A dichotomy for non-repeating queries with negation in probabilistic databasesRobert Fink, Dan Olteanu. 144-155 [doi]
- Database principles in information extractionBenny Kimelfeld. 156-163 [doi]
- Cleaning inconsistencies in information extraction via prioritized repairsRonald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren. 164-175 [doi]
- Nested dependencies: structure and reasoningPhokion G. Kolaitis, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov. 176-187 [doi]
- Does query evaluation tractability help query containment?Pablo Barceló, Miguel Romero 0001, Moshe Y. Vardi. 188-199 [doi]
- Generating low-cost plans from proofsMichael Benedikt, Balder ten Cate, Efthymia Tsamoura. 200-211 [doi]
- Skew in parallel query processingPaul Beame, Paraschos Koutris, Dan Suciu. 212-223 [doi]
- The input/output complexity of triangle enumerationRasmus Pagh, Francesco Silvestri. 224-233 [doi]
- Beyond worst-case analysis for joins with minesweeperHung Q. Ngo, Dung T. Nguyen, Christopher Re, Atri Rudra. 234-245 [doi]
- Independent range samplingXiaocheng Hu, Miao Qiao, Yufei Tao. 246-255 [doi]
- A dynamic I/O-efficient structure for one-dimensional top-k range reportingYufei Tao. 256-265 [doi]
- Categorical range maxima queriesManish Patil, Sharma V. Thankachan, Rahul Shah, Yakov Nekrich, Jeffrey Scott Vitter. 266-277 [doi]
- Cost-oblivious storage reallocationMichael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert. 278-288 [doi]