default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th ICDT 2013: Genoa, Italy
- Wang-Chiew Tan, Giovanna Guerrini, Barbara Catania, Anastasios Gounaris:
Joint 2013 EDBT/ICDT Conferences, ICDT '13 Proceedings, Genoa, Italy, March 18-22, 2013. ACM 2013, ISBN 978-1-4503-1598-2 - Robert Brijder
, Joris J. M. Gillis, Jan Van den Bussche:
The DNA query language DNAQL. 1-9 - Luc Segoufin:
Enumerating with constant delay the answers to a query. 10-20
Invited lectures
- Yehoshua Sagiv:
A personal perspective on keyword search over data graphs. 21-32
Award papers
- Chao Li, Daniel Yang Li, Gerome Miklau, Dan Suciu:
A theory of pricing private data. 33-44
Semi-structured data and XML
- Dominik D. Freydenberger, Timo Kötzing:
Fast learning of restricted regular expressions and DTDs. 45-56 - Pierre Bourhis, Gabriele Puppis, Cristian Riveros:
Which DTDs are streaming bounded repairable? 57-68 - Markus Lohrey, Sebastian Maneth, Eric Noeth:
XML compression via DAGs. 69-80
Query processing and optimization
- Arnaud Durand, Stefan Mengel:
Structural tractability of counting of solutions to conjunctive queries. 81-92 - Serge Abiteboul, Pierre Bourhis, Anca Muscholl, Zhilin Wu:
Recursive queries on trees and data trees. 93-104 - Henrik Björklund, Martin Schuster, Thomas Schwentick, Joscha Kulbatzki:
On optimum left-to-right strategies for active context-free games. 105-116
Graph databases
- Jelle Hellings, Bart Kuijpers, Jan Van den Bussche, Xiaowang Zhang:
Walk logic as a framework for path query languages on graph databases. 117-128 - Leonid Libkin, Wim Martens, Domagoj Vrgoc:
Querying graph databases with XPath. 129-140 - Timos Antonopoulos, Frank Neven, Frédéric Servais:
Definability problems for graph query languages. 141-152
Provenance and annotations
- Floris Geerts, Grigoris Karvounarakis, Vassilis Christophides, Irini Fundulaki:
Algebraic structures for capturing the provenance of SPARQL queries. 153-164 - Susan B. Davidson, Tova Milo, Sudeepa Roy:
A propagation model for provenance views of public/private workflows. 165-176 - Peter Buneman, Egor V. Kostylev, Stijn Vansummeren:
Annotations are relative. 177-188
Data exchange and query answering
- Pablo Barceló, Jorge Pérez, Juan L. Reutter:
Schema mappings and data exchange for graph databases. 189-200 - Claire David, Amélie Gheerbrant, Leonid Libkin, Wim Martens:
Containment of pattern-based queries over data trees. 201-212 - Vince Bárány, Michael Benedikt, Pierre Bourhis:
Access patterns and integrity constraints revisited. 213-224
Ranking query answers
- Susan B. Davidson, Sanjeev Khanna, Tova Milo, Sudeepa Roy:
Using the crowd for top-k and group-by queries. 225-236 - Sara Cohen, Yaacov Y. Weiss:
Certain and possible XPath answers. 237-248 - Benny Kimelfeld, Yehoshua Sagiv:
Extracting minimum-weight tree patterns from a schema with neighborhood constraints. 249-260
Privacy
- Chen Zeng, Jin-Yi Cai, Pinyan Lu, Jeffrey F. Naughton:
On optimal differentially private mechanisms for count-range queries. 261-271 - Chao Li, Gerome Miklau:
Optimal error of query sets under the differentially-private matrix mechanism. 272-283 - Jean Bolot, Nadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov, Nina Taft:
Private decayed predicate sums on streams. 284-295
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 2026-07-16 00:34 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
