


default search action
22nd PODS 2003: San Diego, California, USA
- Frank Neven, Catriel Beeri, Tova Milo:

Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 9-12, 2003, San Diego, CA, USA. ACM 2003, ISBN 1-58113-670-6
PODS Invited Talk
- Richard Hull, Michael Benedikt, Vassilis Christophides, Jianwen Su:

E-services: a look behind the curtain. 1-14
Award Winning Papers
- Marcelo Arenas, Leonid Libkin:

An information-theoretic approach to normal forms for relational and XML data. 15-26
- Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan:

Algorithms for data migration with cloning. 27-36
Invited Tutorial
- Rakesh Agrawal:

Privacy in data systems. 37
Views
- Rada Chirkova, Chen Li:

Materializing views with minimal size to answer queries. 38-48 - Jens Lechtenbörger

:
The impact of the constant complement approach towards view updating. 49-55 - Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi:

View-based query containment. 56-67 - Ashish Kumar Gupta, Dan Suciu, Alon Y. Halevy:

The view selection problem for XML content based routing. 68-77
Data Integration
- Yaron Kanza, Yehoshua Sagiv:

Computing full disjunctions. 78-89 - Ronald Fagin, Phokion G. Kolaitis, Lucian Popa:

Data exchange: getting to the core. 90-101
Optimization
- Andreas Behrend:

Soft stratification for magic set based query evaluation in deductive databases. 102-110 - Gösta Grahne, Alex Thomo

:
Query containment and rewriting using views for regular path queries under constraints. 111-122 - Alberto O. Mendelzon, Ken Q. Pu:

Concise descriptions of subsets of structured sets. 123-133 - Jens-Peter Dittrich, Bernhard Seeger, David Scot Taylor

, Peter Widmayer:
On producing join results early. 134-142
XML
- Minos N. Garofalakis, Amit Kumar:

Correlating XML data streams using tree-edit distance embeddings. 143-154 - Helmut Seidl, Thomas Schwentick, Anca Muscholl:

Numerical document queries. 155-166 - Luc Segoufin:

Typing and querying XML documents: some complexity bounds. 167-178 - Georg Gottlob, Christoph Koch, Reinhard Pichler:

The complexity of XPath query evaluation. 179-190
Security and Privacy
- David Gross-Amblard:

Query-preserving watermarking of relational databases and XML documents. 191-201 - Irit Dinur

, Kobbi Nissim:
Revealing information while preserving privacy. 202-210 - Alexandre V. Evfimievski, Johannes Gehrke

, Ramakrishnan Srikant:
Limiting privacy breaches in privacy preserving data mining. 211-222
Streams and Indexing
- Edith Cohen, Martin Strauss:

Maintaining time-decaying stream aggregates. 223-233 - Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan O'Callaghan:

Maintaining variance and k-medians over data stream windows. 234-243 - Cinda Heeren, H. V. Jagadish, Leonard Pitt:

Optimal indexing using near-minimal space. 244-251 - Charu C. Aggarwal, Dakshi Agrawal:

On nearest neighbor indexing of nonlinear trajectories. 252-259
Integration and Mining
- Andrea Calì, Domenico Lembo, Riccardo Rosati:

On the decidability and complexity of query answering over inconsistent and incomplete databases. 260-271 - Daniel Kifer, Johannes Gehrke, Cristian Bucila, Walker M. White:

How to quickly find a witness. 272-283 - Ganesh Ramesh, William Maniatty, Mohammed Javeed Zaki:

Feasible itemset distributions in data mining: theory and application. 284-295 - Graham Cormode

, S. Muthukrishnan:
What's hot and what's not: tracking most frequent items dynamically. 296-306

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














