Abstract is missing.
- E-services: a look behind the curtainRichard Hull, Michael Benedikt, Vassilis Christophides, Jianwen Su. 1-14 [doi]
- An information-theoretic approach to normal forms for relational and XML dataMarcelo Arenas, Leonid Libkin. 15-26 [doi]
- Algorithms for data migration with cloningSamir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan. 27-36 [doi]
- Privacy in data systemsRakesh Agrawal. 37 [doi]
- Materializing views with minimal size to answer queriesRada Chirkova, Chen Li. 38-48 [doi]
- The impact of the constant complement approach towards view updatingJens Lechtenbörger. 49-55 [doi]
- View-based query containmentDiego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi. 56-67 [doi]
- The view selection problem for XML content based routingAshish Kumar Gupta, Dan Suciu, Alon Y. Halevy. 68-77 [doi]
- Computing full disjunctionsYaron Kanza, Yehoshua Sagiv. 78-89 [doi]
- Data exchange: getting to the coreRonald Fagin, Phokion G. Kolaitis, Lucian Popa. 90-101 [doi]
- Soft stratification for magic set based query evaluation in deductive databasesAndreas Behrend. 102-110 [doi]
- Query containment and rewriting using views for regular path queries under constraintsGösta Grahne, Alex Thomo. 111-122 [doi]
- Concise descriptions of subsets of structured setsAlberto O. Mendelzon, Ken Q. Pu. 123-133 [doi]
- On producing join results earlyJens-Peter Dittrich, Bernhard Seeger, David Scot Taylor, Peter Widmayer. 134-142 [doi]
- Correlating XML data streams using tree-edit distance embeddingsMinos N. Garofalakis, Amit Kumar. 143-154 [doi]
- Numerical document queriesHelmut Seidl, Thomas Schwentick, Anca Muscholl. 155-166 [doi]
- Typing and querying XML documents: some complexity boundsLuc Segoufin. 167-178 [doi]
- The complexity of XPath query evaluationGeorg Gottlob, Christoph Koch, Reinhard Pichler. 179-190 [doi]
- Query-preserving watermarking of relational databases and XML documentsDavid Gross-Amblard. 191-201 [doi]
- Revealing information while preserving privacyIrit Dinur, Kobbi Nissim. 202-210 [doi]
- Limiting privacy breaches in privacy preserving data miningAlexandre V. Evfimievski, Johannes Gehrke, Ramakrishnan Srikant. 211-222 [doi]
- Maintaining time-decaying stream aggregatesEdith Cohen, Martin Strauss. 223-233 [doi]
- Maintaining variance and k-medians over data stream windowsBrian Babcock, Mayur Datar, Rajeev Motwani, Liadan O Callaghan. 234-243 [doi]
- Optimal indexing using near-minimal spaceCinda Heeren, H. V. Jagadish, Leonard Pitt. 244-251 [doi]
- On nearest neighbor indexing of nonlinear trajectoriesCharu C. Aggarwal, Dakshi Agrawal. 252-259 [doi]
- On the decidability and complexity of query answering over inconsistent and incomplete databasesAndrea Calì, Domenico Lembo, Riccardo Rosati. 260-271 [doi]
- How to quickly find a witnessDaniel Kifer, Johannes Gehrke, Cristian Bucila, Walker M. White. 272-283 [doi]
- Feasible itemset distributions in data mining: theory and applicationGanesh Ramesh, William Maniatty, Mohammed Javeed Zaki. 284-295 [doi]
- What s hot and what s not: tracking most frequent items dynamicallyGraham Cormode, S. Muthukrishnan. 296-306 [doi]