![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 28 matches
- 2014
- Serge Abiteboul, Daniel Deutch, Victor Vianu:
Deduction with Contradictions in Datalog. ICDT 2014: 143-154 - Foto N. Afrati, Anish Das Sarma, Anand Rajaraman, Pokey Rule, Semih Salihoglu, Jeffrey D. Ullman:
Anchor-Points Algorithms for Hamming and Edit Distances Using MapReduce. ICDT 2014: 4-14 - Antoine Amarilli, Yael Amsterdamer
, Tova Milo:
On the Complexity of Mining Itemsets from the Crowd Using Taxonomies. ICDT 2014: 15-25 - Tom J. Ameloot:
Deciding Correctness with Fairness for Simple Transducer Networks. ICDT 2014: 84-95 - Arvind Arasu, Raghav Kaushik:
Oblivious Query Processing. ICDT 2014: 26-37 - Paul Beame, Jerry Li, Sudeepa Roy, Dan Suciu:
Counting of Query Expressions: Limitations of Propositional Methods. ICDT 2014: 177-188 - Michael Benedikt, Ronald Fagin, Wim Martens:
The ICDT 2014 Test of Time Award. ICDT 2014: 257 - Christian Bizer
:
Search Joins with the Web. ICDT 2014: 3 - Simone Bova, Hubie Chen:
The Complexity of Width Minimization for Existential Positive Queries. ICDT 2014: 235-244 - Claire David, Piotr Hofman, Filip Murlak
, Michal Pilipczuk:
Synthesizing transformations from XML schema mappings. ICDT 2014: 61-71 - Daniel Deutch, Tova Milo, Sudeepa Roy, Val Tannen:
Circuits for Datalog Provenance. ICDT 2014: 201-212 - Diego Figueira, Santiago Figueira, Carlos Areces:
Basic Model Theory of XPath on Data Trees. ICDT 2014: 50-60 - Nadime Francis, Luc Segoufin, Cristina Sirangelo:
Datalog Rewritings of Regular Path Queries using Views. ICDT 2014: 107-118 - Yeye He, Siddharth Barman, Jeffrey F. Naughton:
On Load Shedding in Complex Event Processing. ICDT 2014: 213-224 - Jelle Hellings:
Conjunctive Context-Free Path Queries. ICDT 2014: 119-130 - Andreas Kosmatopoulos, Apostolos N. Papadopoulos, Kostas Tsichlas:
Dynamic Processing of Dominating Queries with Performance Guarantees. ICDT 2014: 225-234 - Egor V. Kostylev
, Juan L. Reutter, Domagoj Vrgoc:
Containment of Data Graph Queries. ICDT 2014: 131-142 - Paraschos Koutris, Dan Suciu:
A Dichotomy on the Complexity of Consistent Query Answering for Atoms with Simple Keys. ICDT 2014: 165-176 - Dany Maslowski, Jef Wijsen:
Counting Database Repairs that Satisfy Conjunctive Queries with Self-Joins. ICDT 2014: 155-164 - Frank Neven:
Remaining CALM in Declarative Networking. ICDT 2014: 1 - Matthias Niewerth, Thomas Schwentick:
Reasoning about XML Constraints based on XML-to-relational mappings. ICDT 2014: 72-83 - François Picalausa, George H. L. Fletcher, Jan Hidders, Stijn Vansummeren:
Principles of Guarded Structural Indexing. ICDT 2014: 245-256 - Christopher Ré:
Links between Join Processing and Convex Geometry. ICDT 2014: 2 - Christopher Ré:
The Theory of Zeta Graphs with an Application to Random Networks. ICDT 2014: 189-200 - Todd L. Veldhuizen:
Triejoin: A Simple, Worst-Case Optimal Join Algorithm. ICDT 2014: 96-106 - Database Theory - ICDT 2014. ICDT 2014
- Thomas Zeume, Thomas Schwentick:
Dynamic Conjunctive Queries. ICDT 2014: 38-49 - Nicole Schweikardt, Vassilis Christophides, Vincent Leroy:
Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014. OpenProceedings.org 2014 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.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.
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-08-26 14:55 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