• 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 24 matches

• 2017
• 
  Andrew McGregor, Hoa T. Vu:
  Better Streaming Algorithms for the Maximum Coverage Problem. ICDT 2017: 22:1-22:18
• 
  Foto N. Afrati, Manas R. Joglekar, Christopher Ré, Semih Salihoglu, Jeffrey D. Ullman:
  GYM: A Multiround Distributed Join Algorithm. ICDT 2017: 4:1-4:18
• 
  Antoine Amarilli, Yael Amsterdamer, Tova Milo, Pierre Senellart:
  Top-k Querying of Unknown Values under Order Constraints. ICDT 2017: 5:1-5:18
• 
  Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart:
  Combined Tractability of Query Evaluation via Tree Automata and Cycluits. ICDT 2017: 6:1-6:19
• 
  Pablo Barceló, Miguel Romero:
  The Complexity of Reverse Engineering Problems for Conjunctive Queries. ICDT 2017: 7:1-7:17
• 
  Christoph Berkholz, Jens Keppeler, Nicole Schweikardt:
  Answering FO+MOD Queries Under Updates on Bounded Degree Databases. ICDT 2017: 8:1-8:18
• 
  Simone Bova, Hubie Chen:
  How Many Variables Are Needed to Express an Existential Positive Query?. ICDT 2017: 9:1-9:16
• 
  Douglas Burdick, Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
  Expressive Power of Entity-Linking Frameworks. ICDT 2017: 10:1-10:18
• 
  Wei Cao, Jian Li, Haitao Wang, Kangning Wang, Ruosong Wang, Raymond Chi-Wing Wong, Wei Zhan:
  k-Regret Minimizing Set: Efficient Algorithms and Hardness. ICDT 2017: 11:1-11:19
• 
  Shaleen Deep, Paraschos Koutris:
  The Design of Arbitrage-Free Data Pricing Schemes. ICDT 2017: 12:1-12:18
• 
  Cristina Feier, Antti Kuusisto, Carsten Lutz:
  Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk). ICDT 2017: 1:1-1:17
• 
  Dominik D. Freydenberger:
  A Logic for Document Spanners. ICDT 2017: 13:1-13:18
• 
  Minos N. Garofalakis, Vasilis Samoladas:
  Distributed Query Monitoring through Convex Analysis: Towards Composable Safe Zones. ICDT 2017: 14:1-14:18
• 
  Tomasz Gogacz, Szymon Torunczyk:
  Entropy Bounds for Conjunctive Queries with Functional Dependencies. ICDT 2017: 15:1-15:17
• 
  Shachar Itzhaky, Tomer Kotek, Noam Rinetzky, Mooly Sagiv, Orr Tamir, Helmut Veith, Florian Zuleger:
  On the Automated Verification of Web Applications with Embedded SQL. ICDT 2017: 16:1-16:18
• 
  Benny Kimelfeld, Ester Livshits, Liat Peterfreund:
  Detecting Ambiguity in Prioritized Database Repairing. ICDT 2017: 17:1-17:20
• 
  Markus Lohrey, Sebastian Maneth, Carl Philipp Reh:
  Compression of Unordered XML Trees. ICDT 2017: 18:1-18:17
• 
  Dániel Marx:
  Graphs, Hypergraphs, and the Complexity of Conjunctive Database Queries (Invited Talk). ICDT 2017: 2:1-2:1
• 
  Tova Milo:
  The Smart Crowd - Learning from the Ones Who Know (Invited Talk). ICDT 2017: 3:1-3:1
• 
  Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
  Dynamic Complexity under Definable Changes. ICDT 2017: 19:1-19:18
• 
  Luc Segoufin, Alexandre Vigny:
  Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion. ICDT 2017: 20:1-20:16
• 
  Bruhathi Sundarmurthy, Paraschos Koutris, Willis Lang, Jeffrey F. Naughton, Val Tannen:
  m-tables: Representing Missing Data. ICDT 2017: 21:1-21:20
• 
  Front Matter, Table of Contents, Preface, Conference Organization, List of Authors. ICDT 2017: 0:i-0:xii
• 
  Michael Benedikt, Giorgio Orsi:
  20th International Conference on Database Theory, ICDT 2017, March 21-24, 2017, Venice, Italy. LIPIcs 68, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-024-8 [contents]