default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th PODS 2001: Santa Barbara, California, USA
- Peter Buneman:
Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 21-23, 2001, Santa Barbara, California, USA. ACM 2001, ISBN 1-58113-361-8
Invited Talk
- Victor Vianu:
A Web Odyssey: From Codd to XML.
Querying Web Data
- Anand Rajaraman, Jeffrey D. Ullman:
Querying Websites Using Compact Skeletons. - Trevor Jim, Dan Suciu
:
Dynamically Distributed Query Evaluation. - Yaron Kanza, Yehoshua Sagiv:
Flexible Queries Over Semistructured Data.
Queries / Optimization
- Christos H. Papadimitriou, Mihalis Yannakakis:
Multiobjective Query Optimization. - Nilesh N. Dalvi, Sumit K. Sanghai, Prasan Roy, S. Sudarshan:
Pipelining in Multi-Query Optimization. - Reza Sadri, Carlo Zaniolo, Amir M. Zarkesh, Jafar Adibi:
Optimization of Sequence Queries in Database Systems.
Invited Tutorial 1
- Martin Grohe:
The Parameterized Complexity of Database Queries. 82-92
Award Talks
- Kim S. Larsen:
Relaxed Multi-Way Trees with Group Updates. - Ronald Fagin, Amnon Lotem, Moni Naor:
Optimal Aggregation Algorithms for Middleware.
XML
- Wenfei Fan, Leonid Libkin:
On XML Integrity Constraints in the Presence of DTDs. - Makoto Murata:
Extended Path Expressions for XML. - Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu:
XML with Data Values: Typechecking Revisited.
Partial Information
- Serge Abiteboul, Luc Segoufin, Victor Vianu:
Representing and Querying XML with Incomplete Information. - Alberto O. Mendelzon, George A. Mihaila:
Querying Partially Sound and Complete Data Sources. - Sanjeev Khanna, Wang Chiew Tan:
On Computing Functions with Uncertainty.
Expressiveness / Complexity
- Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin:
String Operations in Query Languages. - Georg Gottlob, Nicola Leone, Francesco Scarcello:
Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. - Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Kaushik, Jeffrey F. Naughton:
On the Complexity of Join Predicates.
Aggregates
- Sara Cohen, Werner Nutt, Yehoshua Sagiv:
Equivalences among Aggregate Queries with Negation. - Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss:
Optimal and Approximate Computation of Summary Statistics for Range Aggregates. - Donghui Zhang, Alexander Markowetz, Vassilis J. Tsotras, Dimitrios Gunopulos, Bernhard Seeger:
Efficient Computation of Temporal Aggregates with Range Predicates.
Invited Tutorial 2
- Frank Thomson Leighton:
The Challenges of Delivering Content on the Internet.
Data Mining
- Dakshi Agrawal, Charu C. Aggarwal:
On the Design and Quantification of Privacy Preserving Data Mining Algorithms. - Charu C. Aggarwal:
On the Effects of Dimensionality Reduction on High Dimensional Similarity Search. - Artur Bykowski, Christophe Rigotti:
A condensed representation to find frequent patterns.
Indexing / Transactions
- Dimitris Achlioptas:
Database-friendly random projections. - Paolo Ferragina, Nick Koudas, S. Muthukrishnan, Divesh Srivastava:
Two-dimensional Substring Indexing. - Heiko Schuldt:
Process Locking: A Protocol based on Ordered Shared Locks for the Execution of Transactional Processes.
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.
last updated on 2024-10-31 20:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
