Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th ICDT 2012: Berlin, Germany
- Alin Deutsch:
15th International Conference on Database Theory, ICDT '12, Berlin, Germany, March 26-29, 2012. ACM 2012, ISBN 978-1-4503-0791-8
Invited papers
- Wenfei Fan
:
Graph pattern matching revised for social network analysis. 8-21
Research sessions: award papers
- Balder ten Cate, Gaëlle Fontaine, Phokion G. Kolaitis:
On the data complexity of consistent query answering. 22-33 - Christian Konrad, Frédéric Magniez:
Validating XML documents in the streaming model with external memory. 34-45
Research sessions: semi-structured data
- Serge Abiteboul, Pierre Bourhis, Victor Vianu:
Highly expressive query languages for unordered data trees. 46-60 - Timos Antonopoulos, Dag Hovland, Wim Martens, Frank Neven:
Deciding twig-definability of node selecting tree automata. 61-73 - Leonid Libkin, Domagoj Vrgoc:
Regular path queries on graphs with data. 74-85
Research sessions: relational transducers, normalization
- Tom J. Ameloot, Jan Van den Bussche:
Deciding eventual consistency for a simple class of relational transducer networks. 86-98 - Daniel Zinn, Todd J. Green, Bertram Ludäscher:
Win-move is coordination-free (sometimes). 99-113 - Hugh Darwen, C. J. Date, Ronald Fagin:
A normal form for preventing redundant tuples in relational databases. 114-126
Research sessions: XML
- Serge Abiteboul, Yael Amsterdamer, Daniel Deutch, Tova Milo, Pierre Senellart:
Finding optimal probabilistic generators for XML collections. 127-139 - Slawek Staworko, Piotr Wieczorek:
Learning twig and path queries. 140-154 - Gabriele Puppis, Cristian Riveros, Slawek Staworko:
Bounded repairability for regular tree languages. 155-168
Research sessions: incomplete, inconsistent and annotated data
- Amélie Gheerbrant, Leonid Libkin, Tony Tan:
On the complexity of query answering over incomplete XML documents. 169-181 - Balder ten Cate, Víctor Dalmau, Phokion G. Kolaitis:
Learning schema mappings. 182-195 - Egor V. Kostylev, Peter Buneman:
Combining dependent annotations for relational algebra. 196-207
Research sessions: data exchange and views
- Gösta Grahne, Adrian Onet:
Representation systems for data exchange. 208-221 - André Hernich:
Computing universal models under guarded TGDs. 222-235 - Erich Grädel, Sebastian Siebertz:
Dynamic definability. 236-248
Research sessions: query optimization
- Abhay Kumar Jha, Dan Suciu:
On the tractability of query compilation and bounded treewidth. 249-261 - Rada Chirkova:
Equivalence and minimization of conjunctive queries under combined semantics. 262-273 - Foto N. Afrati, Paraschos Koutris, Dan Suciu, Jeffrey D. Ullman:
Parallel skyline queries. 274-284
Research sessions: data summarization
- Dan Olteanu, Jakub Zavodny:
Factorised representations of query results: size bounds and readability. 285-298 - Graham Cormode, Cecilia M. Procopiuc, Divesh Srivastava, Thanh T. L. Tran:
Differentially private summaries for sparse data. 299-311
a service of 
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-04-18 20:19 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
