Abstract is missing.
- Principles of dataspace systemsAlon Y. Halevy, Michael J. Franklin, David Maier. 1-9 [doi]
- Two-variable logic on data trees and XML reasoningMikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin. 10-19 [doi]
- An adaptive packed-memory arrayMichael A. Bender, Haodong Hu. 20-29 [doi]
- The complexity of data exchangePhokion G. Kolaitis, Jonathan Panttaja, Wang Chiew Tan. 30-39 [doi]
- Data exchange: computing cores in polynomial timeGeorg Gottlob, Alan Nash. 40-49 [doi]
- Inverting schema mappingsRonald Fagin. 50-59 [doi]
- Data exchange and incomplete informationLeonid Libkin. 60-69 [doi]
- Equivalence of queries combining set and bag-set semanticsSara Cohen. 70-79 [doi]
- The containment problem for REAL conjunctive queries with inequalitiesT. S. Jayram, Phokion G. Kolaitis, Erik Vee. 80-89 [doi]
- Verification of communicating data-driven web servicesAlin Deutsch, Liying Sui, Victor Vianu, Dayou Zhou. 90-99 [doi]
- Analyzing workflows implied by instance-dependent access rulesToon Calders, Stijn Dekeyser, Jan Hidders, Jan Paredaens. 100-109 [doi]
- From statistical knowledge bases to degrees of belief: an overviewJoseph Y. Halpern. 110-113 [doi]
- On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NFSolmaz Kolahi, Leonid Libkin. 114-123 [doi]
- Tractable database design through bounded treewidthGeorg Gottlob, Reinhard Pichler, Fang Wei. 124-133 [doi]
- Evolution of page popularity under random web graph modelsRajeev Motwani, Ying Xu 0002. 134-142 [doi]
- Privacy via pseudorandom sketchesNina Mishra, Mark Sandler. 143-152 [doi]
- Achieving anonymity via clusteringGagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, An Zhu. 153-162 [doi]
- On the efficiency of checking perfect privacyAshwin Machanavajjhala, Johannes Gehrke. 163-172 [doi]
- Finding and approximating top-k answers in keyword proximity searchBenny Kimelfeld, Yehoshua Sagiv. 173-182 [doi]
- Efficiently ordering subgoals with access constraintsGuizhen Yang, Michael Kifer, Vinay K. Chaudhri. 183-192 [doi]
- Flow algorithms for two pipelined filter ordering problemsAnne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu. 193-202 [doi]
- Asking the right questions: model-driven optimization using probesAshish Goel, Sudipto Guha, Kamesh Munagala. 203-212 [doi]
- Processing queries on tree-structured data efficientlyChristoph Koch. 213-224 [doi]
- Scalable computation of acyclic joinsAnna Pagh, Rasmus Pagh. 225-232 [doi]
- Cache-oblivious string B-treesMichael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul. 233-242 [doi]
- Randomized computations on large data sets: tight lower boundsMartin Grohe, André Hernich, Nicole Schweikardt. 243-252 [doi]
- Counting triangles in data streamsLuciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, Christian Sohler. 253-262 [doi]
- Space- and time-efficient deterministic algorithms for biased quantiles over data streamsGraham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava. 263-272 [doi]
- Approximate quantiles and the order of the streamSudipto Guha, Andrew McGregor. 273-279 [doi]
- Deterministic k-set structureSumit Ganguly, Anirban Majumder. 280-289 [doi]
- A simpler and more efficient deterministic scheme for finding frequent items over sliding windowsLap-Kei Lee, H. F. Ting. 290-297 [doi]
- Finding global icebergs over distributed data setsQi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu. 298-307 [doi]
- Efficient gossip-based aggregate computationSrinivas R. Kashyap, Supratim Deb, K. V. M. Naidu, Rajeev Rastogi, Anand Srinivasan. 308-317 [doi]
- Structural characterizations of the semantics of XPath as navigation tool on a documentMarc Gyssens, Jan Paredaens, Dirk Van Gucht, George H. L. Fletcher. 318-327 [doi]
- The expressivity of XPath with transitive closureBalder ten Cate. 328-337 [doi]
- Relational lenses: a language for updatable viewsAaron Bohannon, Benjamin C. Pierce, Jeffrey A. Vaughan. 338-347 [doi]
- Programmable clusteringSreenivas Gollapudi, Ravi Kumar, D. Sivakumar. 348-354 [doi]
- The logic of RDF and SPARQL: a tutorialEnrico Franconi, Sergio Tessaris. 355 [doi]
- On the decidability and finite controllability of query processing in databases with incomplete informationRiccardo Rosati. 356-365 [doi]