Abstract is missing.
- ForwordDan Suciu. [doi]
- The Lixto Data Extraction Project - Back and Forth between Theory and PracticeGeorg Gottlob, Christoph Koch, Robert Baumgartner, Marcus Herzog, Sergio Flesca. 1-12 [doi]
- Conditional XPath, the First Order Complete XPath DialectMaarten Marx. 13-22 [doi]
- Frontiers of Tractability for Typechecking Simple XML TransformationsWim Martens, Frank Neven. 23-34 [doi]
- Positive Active XMLSerge Abiteboul, Omar Benjelloun, Tova Milo. 35-45 [doi]
- The Past, Present and Future of Web Information RetrievalMonika Rauch Henzinger. 46 [doi]
- Comparing and Aggregating Rankings with TiesRonald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee. 47-58 [doi]
- Using Non-Linear Dynamical Systems for Web Searching and RankingPanayiotis Tsaparas. 59-70 [doi]
- Specification and Verification of Data-driven Web ServicesAlin Deutsch, Liying Sui, Victor Vianu. 71-82 [doi]
- Composing Schema Mappings: Second-Order Dependencies to the RescueRonald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan. 83-94 [doi]
- Foundations of Semantic Web DatabasesClaudio Gutiérrez, Carlos A. Hurtado, Alberto O. Mendelzon. 95-106 [doi]
- A Characterization of First-Order Topological Properties of Planar Spatial DataMichael Benedikt, Christof Löding, Jan Van den Bussche, Thomas Wilke. 107-114 [doi]
- Roads, Codes and Spatiotemporal QueriesSandeep Gupta, Swastik Kopparty, Chinya V. Ravishankar. 115-124 [doi]
- Replicated Declustering of Spatial DataHakan Ferhatosmanoglu, Aravind Ramachandran, Ali Saman Tosun. 125-135 [doi]
- Clustering via Matrix PoweringHanson Zhou, David P. Woodruff. 136-142 [doi]
- Computational Complexity of Itemset Frequency SatisfiabilityToon Calders. 143-154 [doi]
- k-Means Projective ClusteringPankaj K. Agarwal, Nabil H. Mustafa. 155-165 [doi]
- Deterministic Wavelet Thresholding for Maximum-Error MetricsMinos N. Garofalakis, Amit Kumar. 166-176 [doi]
- On the Memory Requirements of XPath Evaluation over XML StreamsZiv Bar-Yossef, Marcus Fontoura, Vanja Josifovski. 177-188 [doi]
- Conjunctive Queries over TreesGeorg Gottlob, Christoph Koch, Klaus U. Schulz. 189-200 [doi]
- Synopses for Query Optimization: A Space-Complexity PerspectiveRaghav Kaushik, Raghu Ramakrishnan, Venkatesan T. Chakaravarthy. 201-209 [doi]
- Weighted Hypertree Decompositions and Optimal Query PlansFrancesco Scarcello, Gianluigi Greco, Nicola Leone. 210-221 [doi]
- Trees, Automata and XMLThomas Schwentick. 222 [doi]
- On the Complexity of Optimal K-AnonymityAdam Meyerson, Ryan Williams. 223-228 [doi]
- Locally Consistent Transformations and Query Answering in Data ExchangeMarcelo Arenas, Pablo Barceló, Ronald Fagin, Leonid Libkin. 229-240 [doi]
- Logical Foundations of Peer-To-Peer Data IntegrationDiego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Riccardo Rosati. 241-251 [doi]
- Adaptive Sampling for Geometric Problems over Data StreamsJohn Hershberger, Subhash Suri. 252-262 [doi]
- Flexible Time Management in Data Stream SystemsUtkarsh Srivastava, Jennifer Widom. 263-274 [doi]
- Power-Conserving Computation of Order-Statistics over Sensor NetworksMichael Greenwald, Sanjeev Khanna. 275-285 [doi]
- Approximate Counts and Quantiles over Sliding WindowsArvind Arasu, Gurmeet Singh Manku. 286-296 [doi]
- On the Decidability of Containment of Recursive Datalog Queries - Preliminary reportPiero A. Bonatti. 297-306 [doi]
- Processing First-Order Queries under Limited Access PatternsAlan Nash, Bertram Ludäscher. 307-318 [doi]
- On Preservation under Homomorphisms and Unions of Conjunctive QueriesAlbert Atserias, Anuj Dawar, Phokion G. Kolaitis. 319-329 [doi]
- Multi-valued Dependencies in the Presence of ListsSven Hartmann, Sebastian Link. 330-341 [doi]