• 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.

found 22 matches

• 2018
• 
  Shqiponja Ahmetaj, Magdalena Ortiz, Mantas Simkus:
  Rewriting Guarded Existential Rules into Small Datalog Programs. ICDT 2018: 4:1-4:24
• 
  Antoine Amarilli, Pierre Bourhis, Stefan Mengel:
  Enumeration on Trees under Relabelings. ICDT 2018: 5:1-5:18
• 
  Antoine Amarilli, Mikaël Monet, Pierre Senellart:
  Connecting Width and Structure in Knowledge Compilation. ICDT 2018: 6:1-6:17
• 
  Pablo Barceló, Miguel Romero, Thomas Zeume:
  A More General Theory of Static Approximations for Conjunctive Queries. ICDT 2018: 7:1-7:22
• 
  Christoph Berkholz, Jens Keppeler, Nicole Schweikardt:
  Answering UCQs under Updates and in the Presence of Integrity Constraints. ICDT 2018: 8:1-8:19
• 
  Elena Botoeva, Diego Calvanese, Benjamin Cogrel, Guohui Xiao:
  Expressivity and Complexity of MongoDB Queries. ICDT 2018: 9:1-9:23
• 
  Robert Brijder, Floris Geerts, Jan Van den Bussche, Timmy Weerwag:
  On the Expressive Power of Query Languages for Matrices. ICDT 2018: 10:1-10:17
• 
  Nofar Carmeli, Markus Kröll:
  Enumeration Complexity of Conjunctive Queries with Functional Dependencies. ICDT 2018: 11:1-11:17
• 
  David Carral, Markus Krötzsch, Maximilian Marx, Ana Ozaki, Sebastian Rudolph:
  Preserving Constraints with the Stable Chase. ICDT 2018: 12:1-12:19
• 
  Graham Cormode, Jacques Dark:
  Fast Sketch-based Recovery of Correlation Outliers. ICDT 2018: 13:1-13:18
• 
  Johannes Doleschal, Wim Martens, Frank Neven, Adam Witkowski:
  Satisfiability for SCULPT-Schemas for CSV-Like Data. ICDT 2018: 14:1-14:19
• 
  Jean Christoph Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider:
  Querying the Unary Negation Fragment with Regular Path Expressions. ICDT 2018: 15:1-15:18
• 
  Ahmet Kara, Dan Olteanu:
  Covers of Query Results. ICDT 2018: 16:1-16:22
• 
  Bas Ketsman, Aws Albarghouthi, Paraschos Koutris:
  Distribution Policies for Datalog. ICDT 2018: 17:1-17:22
• 
  Bas Ketsman, Frank Neven, Brecht Vandevoort:
  Parallel-Correctness and Transferability for Conjunctive Queries under Bag Semantics. ICDT 2018: 18:1-18:16
• 
  Wim Martens, Tina Trautner:
  Evaluation and Enumeration Problems for Regular Path Queries. ICDT 2018: 19:1-19:21
• 
  Yufei Tao:
  Massively Parallel Entity Matching with Linear Classification in Low Dimensional Space. ICDT 2018: 20:1-20:19
• 
  Virginia Vassilevska Williams:
  Fine-grained Algorithms and Complexity. ICDT 2018: 1:1-1:1
• 
  Front Matter, Table of Contents, Preface, Conference Organization. ICDT 2018: 0:i-0:xvi
• 
  Ke Yi:
  Join Algorithms: From External Memory to the BSP. ICDT 2018: 2:1-2:1
• 
  Thomas Zeume:
  An Update on Dynamic Complexity Theory. ICDT 2018: 3:1-3:1
• 
  Benny Kimelfeld, Yael Amsterdamer:
  21st International Conference on Database Theory, ICDT 2018, March 26-29, 2018, Vienna, Austria. LIPIcs 98, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-063-7 [contents]