![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
ACM Transactions on Database Systems (TODS) , Volume 30
Volume 30, Number 1, March 2005
- Tova Milo, Serge Abiteboul, Bernd Amann
, Omar Benjelloun, Frederic Dang Ngoc:
Exchanging intensional XML data. 1-40 - Dimitris Papadias, Yufei Tao
, Greg Fu, Bernhard Seeger:
Progressive skyline computation in database systems. 41-82 - Andrew Witkowski, Srikanth Bellamkonda, Tolga Bozkaya, Nathan Folkert, Abhinav Gupta, John Haydu, Lei Sheng, Sankar Subramanian:
Advanced SQL modeling in RDBMS. 83-121 - Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein, Wei Hong:
TinyDB: an acquisitional query processing system for sensor networks. 122-173 - Ronald Fagin, Phokion G. Kolaitis, Lucian Popa:
Data exchange: getting to the core. 174-210 - Ken Q. Pu, Alberto O. Mendelzon:
Concise descriptions of subsets of structured sets. 211-248 - Graham Cormode
, S. Muthukrishnan:
What's hot and what's not: tracking most frequent items dynamically. 249-278 - Minos N. Garofalakis, Amit Kumar:
XML stream processing using tree-edit distance embeddings. 279-332
Volume 30, Number 2, June 2005
- Floris Geerts
, Bart Goethals
, Jan Van den Bussche:
Tight upper bounds on the number of candidate patterns. 333-363 - H. V. Jagadish, Beng Chin Ooi, Kian-Lee Tan
, Cui Yu, Rui Zhang:
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search. 364-397 - Daniele Braga, Alessandro Campi
, Stefano Ceri:
XQBE (XQuery By Example): A visual interface to the standard XML query language. 398-443 - Georg Gottlob
, Christoph Koch, Reinhard Pichler:
Efficient algorithms for processing XPath queries. 444-491 - Alan D. Fekete, Dimitrios Liarokapis, Elizabeth J. O'Neil, Patrick E. O'Neil, Dennis E. Shasha:
Making snapshot isolation serializable. 492-528 - Dimitris Papadias, Yufei Tao
, Kyriakos Mouratidis
, Chun Kit Hui:
Aggregate nearest neighbor queries in spatial databases. 529-576 - Feng Peng, Sudarshan S. Chawathe:
XSQ: A streaming XPath engine. 577-623 - Catharine M. Wyss, Edward L. Robertson:
Relational languages for metadata integration. 624-660
Volume 30, Number 3, September 2005
- Rui Zhang, Panos Kalnis, Beng Chin Ooi, Kian-Lee Tan
:
Generalized multidimensional data mapping and query processing. 661-697 - Chaoyi Pang, Guozhu Dong, Kotagiri Ramamohanarao
:
Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL. 698-721 - Jef Wijsen
:
Database repairing using updates. 722-768 - Witold Litwin, Rim Moussa, Thomas J. E. Schwarz:
LH*RS - a highly-available scalable distributed data structure. 769-811 - Zhen He
, Byung Suk Lee, Robert R. Snapp:
Self-tuning cost modeling of user-defined functions in an object-relational DBMS. 812-853 - Carlos A. Hurtado, Claudio Gutierrez
, Alberto O. Mendelzon:
Capturing summarizability with integrity constraints in OLAP. 854-886
Volume 30, Number 4, December 2005
- Dan Suciu
, Gerhard Weikum:
Foreword. 887 - Minos N. Garofalakis, Amit Kumar:
Wavelet synopses for general error metrics. 888-928 - Maarten Marx
:
Conditional XPath. 929-959 - Xifeng Yan, Philip S. Yu, Jiawei Han:
Graph indexing based on discriminative frequent structure analysis. 960-993 - Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
Composing schema mappings: Second-order dependencies to the rescue. 994-1055 - Ivan T. Bowman, Kenneth Salem:
Optimization of query streams using semantic prefetching. 1056-1101 - Raghav Kaushik, Jeffrey F. Naughton, Raghu Ramakrishnan, Venkatesan T. Chakaravarthy:
Synopses for query optimization: A space-complexity perspective. 1102-1127
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.