default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Database Systems (TODS) , Volume 35
Volume 35, Number 1, February 2010
- Thanaa M. Ghanem, Ahmed K. Elmagarmid, Per-Åke Larson, Walid G. Aref:
Supporting views in data stream management systems. 1:1-1:47 - Kesheng Wu
, Arie Shoshani, Kurt Stockinger:
Analyses of multi-level and multi-component compressed bitmap indexes. 2:1-2:52 - Xiang Lian, Lei Chen:
Reverse skyline search in uncertain databases. 3:1-3:49 - Nikolaus Augsten, Michael H. Böhlen, Johann Gamper:
The pq-gram distance between ordered labeled trees. 4:1-4:36 - Solmaz Kolahi, Leonid Libkin:
An information-theoretic analysis of worst-case redundancy in database design. 5:1-5:32 - Karl Schnaitter, Neoklis Polyzotis:
Optimal algorithms for evaluating rank joins in database systems. 6:1-6:47 - Ahmed A. Soror, Umar Farooq Minhas, Ashraf Aboulnaga, Kenneth Salem, Peter Kokosielis, Sunil Kamath:
Automatic virtual machine configuration for database workloads. 7:1-7:47
Volume 35, Number 2, April 2010
- Xiaokui Xiao, Yufei Tao, Nick Koudas:
Transparent anonymization: Thwarting adversaries who know the algorithm. 8:1-8:48 - Leong Hou U, Kyriakos Mouratidis, Man Lung Yiu, Nikos Mamoulis:
Optimal matching between spatial datasets under capacity constraints. 9:1-9:44 - Ziyang Liu, Yi Chen:
Return specification inference and result clustering for keyword search on XML. 10:1-10:47 - Geert Jan Bex, Frank Neven, Thomas Schwentick, Stijn Vansummeren:
Inference of concise regular expressions and DTDs. 11:1-11:47 - Sabrina De Capitani di Vimercati, Sara Foresti, Sushil Jajodia, Stefano Paraboschi, Pierangela Samarati:
Encryption policies for regulating access to outsourced data. 12:1-12:46 - Georgia Koutrika, Yannis E. Ioannidis:
Personalizing queries based on networks of composite preferences. 13:1-13:50 - Sergio Flesca, Filippo Furfaro, Francesco Parisi:
Querying and repairing inconsistent numerical databases. 14:1-14:50 - Hongyan Liu, Xiaoyu Wang, Yinghui Yang:
Comments on "an integrated efficient solution for computing frequent and top-k elements in data streams". 15:1-15:4
Volume 35, Number 3, July 2010
- Goetz Graefe:
A survey of B-tree locking techniques. 16:1-16:26 - Su Chen, Mario A. Nascimento, Beng Chin Ooi, Kian-Lee Tan:
Continuous online index tuning in moving object databases. 17:1-17:51 - Haibo Hu, Jianliang Xu, Sai Tung On, Jing Du, Joseph Kee-Yin Ng:
Privacy-aware location data publishing. 18:1-18:42 - Ziyang Liu, Yu Huang, Yi Chen:
Improving XML search by generating and utilizing informative result snippets. 19:1-19:45 - Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis:
Efficient and accurate nearest neighbor and closest pair search in high-dimensional space. 20:1-20:46 - Alan Nash, Luc Segoufin, Victor Vianu:
Views and queries: Determinacy and rewriting. 21:1-21:41 - Marc Denecker, Alvaro Cortés-Calabuig, Maurice Bruynooghe, Ofer Arieli:
Towards a logical reconstruction of a theory for locally closed databases. 22:1-22:60
Volume 35, Number 4, November 2010
- Z. Meral Özsoyoglu:
Foreword to TODS invited papers issue. 23:1-23:2 - Milena Ivanova, Martin L. Kersten, Niels J. Nes, Romulo Goncalves:
An architecture for recycling intermediates in a column-store. 24:1-24:43 - Amol Ghoting, Konstantin Makarychev:
I/O efficient algorithms for serial and parallel suffix tree construction. 25:1-25:37 - Radu Berinde, Piotr Indyk, Graham Cormode, Martin J. Strauss:
Space-optimal heavy hitters with strong error bounds. 26:1-26:28 - Wenfei Fan, Floris Geerts:
Relative information completeness. 27:1-27:44 - George H. L. Fletcher, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Towards a theory of search queries. 28:1-28:33 - Henrik Björklund, Wouter Gelade, Wim Martens:
Incremental XPath evaluation. 29:1-29:43
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 2025-01-24 17:15 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:
