Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 26 matches
- 2013
- Serge Abiteboul, Pierre Bourhis, Anca Muscholl, Zhilin Wu:
Recursive queries on trees and data trees. ICDT 2013: 93-104 - Timos Antonopoulos, Frank Neven, Frédéric Servais:
Definability problems for graph query languages. ICDT 2013: 141-152 - Vince Bárány, Michael Benedikt, Pierre Bourhis:
Access patterns and integrity constraints revisited. ICDT 2013: 213-224 - Pablo Barceló, Jorge Pérez, Juan L. Reutter:
Schema mappings and data exchange for graph databases. ICDT 2013: 189-200 - Henrik Björklund, Martin Schuster, Thomas Schwentick, Joscha Kulbatzki:
On optimum left-to-right strategies for active context-free games. ICDT 2013: 105-116 - Jean Bolot, Nadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov, Nina Taft:
Private decayed predicate sums on streams. ICDT 2013: 284-295 - Pierre Bourhis, Gabriele Puppis, Cristian Riveros:
Which DTDs are streaming bounded repairable? ICDT 2013: 57-68 - Robert Brijder, Joris J. M. Gillis, Jan Van den Bussche:
The DNA query language DNAQL. ICDT 2013: 1-9 - Peter Buneman, Egor V. Kostylev, Stijn Vansummeren:
Annotations are relative. ICDT 2013: 177-188 - Sara Cohen, Yaacov Y. Weiss:
Certain and possible XPath answers. ICDT 2013: 237-248 - Claire David, Amélie Gheerbrant, Leonid Libkin, Wim Martens:
Containment of pattern-based queries over data trees. ICDT 2013: 201-212 - Susan B. Davidson, Sanjeev Khanna, Tova Milo, Sudeepa Roy:
Using the crowd for top-k and group-by queries. ICDT 2013: 225-236 - Susan B. Davidson, Tova Milo, Sudeepa Roy:
A propagation model for provenance views of public/private workflows. ICDT 2013: 165-176 - Arnaud Durand, Stefan Mengel:
Structural tractability of counting of solutions to conjunctive queries. ICDT 2013: 81-92 - Dominik D. Freydenberger, Timo Kötzing:
Fast learning of restricted regular expressions and DTDs. ICDT 2013: 45-56 - Floris Geerts, Grigoris Karvounarakis, Vassilis Christophides, Irini Fundulaki:
Algebraic structures for capturing the provenance of SPARQL queries. ICDT 2013: 153-164 - Jelle Hellings, Bart Kuijpers, Jan Van den Bussche, Xiaowang Zhang:
Walk logic as a framework for path query languages on graph databases. ICDT 2013: 117-128 - Benny Kimelfeld, Yehoshua Sagiv:
Extracting minimum-weight tree patterns from a schema with neighborhood constraints. ICDT 2013: 249-260 - Chao Li, Daniel Yang Li, Gerome Miklau, Dan Suciu:
A theory of pricing private data. ICDT 2013: 33-44 - Chao Li, Gerome Miklau:
Optimal error of query sets under the differentially-private matrix mechanism. ICDT 2013: 272-283 - Leonid Libkin, Wim Martens, Domagoj Vrgoc:
Querying graph databases with XPath. ICDT 2013: 129-140 - Markus Lohrey, Sebastian Maneth, Eric Noeth:
XML compression via DAGs. ICDT 2013: 69-80 - Yehoshua Sagiv:
A personal perspective on keyword search over data graphs. ICDT 2013: 21-32 - Luc Segoufin:
Enumerating with constant delay the answers to a query. ICDT 2013: 10-20 - Chen Zeng, Jin-Yi Cai, Pinyan Lu, Jeffrey F. Naughton:
On optimal differentially private mechanisms for count-range queries. ICDT 2013: 261-271 - 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 [contents]
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-09 21:50 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint