@Proceedings{martens_et_al:LIPIcs.ICDT.2016,
title = {{LIPIcs, Volume 48, ICDT'16, Complete Volume}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016},
URN = {urn:nbn:de:0030-drops-57991},
doi = {10.4230/LIPIcs.ICDT.2016},
annote = {Keywords: Database Management, Normal forms, Schema and subschema, Query languages, Query processing, Relational databases, Distributed databases, Heterogeneous Databases, Online Information Services,Miscellaneous – Privacy, Office Automation: Workflow management}
}
@InProceedings{martens_et_al:LIPIcs.ICDT.2016.0,
author = {Martens, Wim and Zeume, Thomas},
title = {{Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers, List of Authors}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.0},
URN = {urn:nbn:de:0030-drops-57940},
doi = {10.4230/LIPIcs.ICDT.2016.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers, List of Authors}
}
@InProceedings{afrati_et_al:LIPIcs.ICDT.2016.1,
author = {Afrati, Foto N. and David, Claire and Gottlob, Georg},
title = {{The ICDT 2016 Test of Time Award Announcement}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {1:1--1:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.1},
URN = {urn:nbn:de:0030-drops-57938},
doi = {10.4230/LIPIcs.ICDT.2016.1},
annote = {Keywords: conjunctive query, treewidth, NP-hardness, rewriting}
}
@InProceedings{geerts:LIPIcs.ICDT.2016.2,
author = {Geerts, Floris},
title = {{Scale Independence: Using Small Data to Answer Queries on Big Data}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {2:1--2:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.2},
URN = {urn:nbn:de:0030-drops-57715},
doi = {10.4230/LIPIcs.ICDT.2016.2},
annote = {Keywords: Scale independence, Access constraints, Query processing}
}
@InProceedings{tao:LIPIcs.ICDT.2016.3,
author = {Tao, Yufei},
title = {{Top-k Indexes Made Small and Sweet}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.3},
URN = {urn:nbn:de:0030-drops-57725},
doi = {10.4230/LIPIcs.ICDT.2016.3},
annote = {Keywords: Data Structures, Top-k, External Memory, RAM, Reductions}
}
@InProceedings{woodruff:LIPIcs.ICDT.2016.4,
author = {Woodruff, David P.},
title = {{New Algorithms for Heavy Hitters in Data Streams}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {4:1--4:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.4},
URN = {urn:nbn:de:0030-drops-57739},
doi = {10.4230/LIPIcs.ICDT.2016.4},
annote = {Keywords: data streams, heavy hitters}
}
@InProceedings{kaminski_et_al:LIPIcs.ICDT.2016.5,
author = {Kaminski, Mark and Kostylev, Egor V.},
title = {{Beyond Well-designed SPARQL}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {5:1--5:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.5},
URN = {urn:nbn:de:0030-drops-57744},
doi = {10.4230/LIPIcs.ICDT.2016.5},
annote = {Keywords: RDF, Query languages, SPARQL, Optional matching}
}
@InProceedings{dasgupta_et_al:LIPIcs.ICDT.2016.6,
author = {Dasgupta, Anirban and Lang, Kevin J. and Rhodes, Lee and Thaler, Justin},
title = {{A Framework for Estimating Stream Expression Cardinalities}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {6:1--6:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.6},
URN = {urn:nbn:de:0030-drops-57754},
doi = {10.4230/LIPIcs.ICDT.2016.6},
annote = {Keywords: sketching, data stream algorithms, mergeability, distinct elements, set operations}
}
@InProceedings{barany_et_al:LIPIcs.ICDT.2016.7,
author = {Barany, Vince and ten Cate, Balder and Kimelfeld, Benny and Olteanu, Dan and Vagena, Zografoula},
title = {{Declarative Probabilistic Programming with Datalog}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {7:1--7:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.7},
URN = {urn:nbn:de:0030-drops-57761},
doi = {10.4230/LIPIcs.ICDT.2016.7},
annote = {Keywords: Chase, Datalog, probability measure space, probabilistic programming}
}
@InProceedings{koutris_et_al:LIPIcs.ICDT.2016.8,
author = {Koutris, Paraschos and Beame, Paul and Suciu, Dan},
title = {{Worst-Case Optimal Algorithms for Parallel Query Processing}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {8:1--8:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.8},
URN = {urn:nbn:de:0030-drops-57771},
doi = {10.4230/LIPIcs.ICDT.2016.8},
annote = {Keywords: conjunctive query, parallel computation, worst-case bounds}
}
@InProceedings{geck_et_al:LIPIcs.ICDT.2016.9,
author = {Geck, Gaetano and Ketsman, Bas and Neven, Frank and Schwentick, Thomas},
title = {{Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {9:1--9:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.9},
URN = {urn:nbn:de:0030-drops-57787},
doi = {10.4230/LIPIcs.ICDT.2016.9},
annote = {Keywords: Conjunctive queries, distributed evaluation}
}
@InProceedings{abiteboul_et_al:LIPIcs.ICDT.2016.10,
author = {Abiteboul, Serge and Bourhis, Pierre and Vianu, Victor},
title = {{A Formal Study of Collaborative Access Control in Distributed Datalog}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {10:1--10:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.10},
URN = {urn:nbn:de:0030-drops-57794},
doi = {10.4230/LIPIcs.ICDT.2016.10},
annote = {Keywords: Distributed datalog, access control, provenance}
}
@InProceedings{joglekar_et_al:LIPIcs.ICDT.2016.11,
author = {Joglekar, Manas R. and R\'{e}, Christopher M.},
title = {{It's All a Matter of Degree: Using Degree Information to Optimize Multiway Joins}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {11:1--11:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.11},
URN = {urn:nbn:de:0030-drops-57800},
doi = {10.4230/LIPIcs.ICDT.2016.11},
annote = {Keywords: Joins, Degree, MapReduce}
}
@InProceedings{groz_et_al:LIPIcs.ICDT.2016.12,
author = {Groz, Benoit and Levin, Ezra and Meilijson, Isaac and Milo, Tova},
title = {{Filtering With the Crowd: CrowdScreen Revisited}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {12:1--12:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.12},
URN = {urn:nbn:de:0030-drops-57817},
doi = {10.4230/LIPIcs.ICDT.2016.12},
annote = {Keywords: CrowdSourcing, filtering, algorithms, sprt, hypothesis testing}
}
@InProceedings{konrad:LIPIcs.ICDT.2016.13,
author = {Konrad, Christian},
title = {{Streaming Partitioning of Sequences and Trees}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {13:1--13:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.13},
URN = {urn:nbn:de:0030-drops-57829},
doi = {10.4230/LIPIcs.ICDT.2016.13},
annote = {Keywords: Streaming Algorithms, XML Documents, Data Partitioning, Communication Complexity}
}
@InProceedings{munoz_et_al:LIPIcs.ICDT.2016.14,
author = {Mu\~{n}oz, Pablo and Vortmeier, Nils and Zeume, Thomas},
title = {{Dynamic Graph Queries}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {14:1--14:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.14},
URN = {urn:nbn:de:0030-drops-57830},
doi = {10.4230/LIPIcs.ICDT.2016.14},
annote = {Keywords: Dynamic descriptive complexity, graph databases, graph products, reachability, path queries}
}
@InProceedings{calvanese_et_al:LIPIcs.ICDT.2016.15,
author = {Calvanese, Diego and Ortiz, Magdalena and \v{S}imkus, Mantas},
title = {{Verification of Evolving Graph-structured Data under Expressive Path Constraints}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {15:1--15:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.15},
URN = {urn:nbn:de:0030-drops-57843},
doi = {10.4230/LIPIcs.ICDT.2016.15},
annote = {Keywords: Path constraints, Description Logics, Graph databases, Static verification}
}
@InProceedings{savkovic_et_al:LIPIcs.ICDT.2016.16,
author = {Savkovic, Ognjen and Marengo, Elisa and Nutt, Werner},
title = {{Query Stability in Monotonic Data-Aware Business Processes}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {16:1--16:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.16},
URN = {urn:nbn:de:0030-drops-57851},
doi = {10.4230/LIPIcs.ICDT.2016.16},
annote = {Keywords: Business Processes, Query Stability}
}
@InProceedings{freydenberger_et_al:LIPIcs.ICDT.2016.17,
author = {Freydenberger, Dominik D. and Holldack, Mario},
title = {{Document Spanners: From Expressive Power to Decision Problems}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {17:1--17:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.17},
URN = {urn:nbn:de:0030-drops-57867},
doi = {10.4230/LIPIcs.ICDT.2016.17},
annote = {Keywords: Information extraction, document spanners, regular expressions, regex, patterns, word equations, decision problems, descriptional complexity}
}
@InProceedings{assadi_et_al:LIPIcs.ICDT.2016.18,
author = {Assadi, Sepehr and Khanna, Sanjeev and Li, Yang and Tannen, Val},
title = {{Algorithms for Provisioning Queries and Analytics}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {18:1--18:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.18},
URN = {urn:nbn:de:0030-drops-57877},
doi = {10.4230/LIPIcs.ICDT.2016.18},
annote = {Keywords: What-if Analysis, Provisioning, Data Compression, Approximate Query Answering}
}
@InProceedings{kolaitis_et_al:LIPIcs.ICDT.2016.19,
author = {Kolaitis, Phokion G. and Pichler, Reinhard and Sallinger, Emanuel and Savenkov, Vadim},
title = {{Limits of Schema Mappings}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {19:1--19:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.19},
URN = {urn:nbn:de:0030-drops-57882},
doi = {10.4230/LIPIcs.ICDT.2016.19},
annote = {Keywords: Limit, Pointwise convergence, Uniform convergence, Schema mapping}
}
@InProceedings{czerwinski_et_al:LIPIcs.ICDT.2016.20,
author = {Czerwinski, Wojciech and David, Claire and Murlak, Filip and Parys, Pawel},
title = {{Reasoning About Integrity Constraints for Tree-Structured Data}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {20:1--20:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.20},
URN = {urn:nbn:de:0030-drops-57897},
doi = {10.4230/LIPIcs.ICDT.2016.20},
annote = {Keywords: data trees, integrity constraints, unions of conjunctive queries, schema mappings, entailment, containment, consistency}
}
@InProceedings{arming_et_al:LIPIcs.ICDT.2016.21,
author = {Arming, Sebastian and Pichler, Reinhard and Sallinger, Emanuel},
title = {{Complexity of Repair Checking and Consistent Query Answering}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {21:1--21:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.21},
URN = {urn:nbn:de:0030-drops-57900},
doi = {10.4230/LIPIcs.ICDT.2016.21},
annote = {Keywords: inconsistency, consistent query answering, complexity}
}
@InProceedings{kroll_et_al:LIPIcs.ICDT.2016.22,
author = {Kr\"{o}ll, Markus and Pichler, Reinhard and Skritek, Sebastian},
title = {{On the Complexity of Enumerating the Answers to Well-designed Pattern Trees}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {22:1--22:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.22},
URN = {urn:nbn:de:0030-drops-57912},
doi = {10.4230/LIPIcs.ICDT.2016.22},
annote = {Keywords: SPARQL, Pattern Trees, CQs, Enumeration, Complexity}
}
@InProceedings{golenberg_et_al:LIPIcs.ICDT.2016.23,
author = {Golenberg, Konstantin and Sagiv, Yehoshua},
title = {{A Practically Efficient Algorithm for Generating Answers to Keyword Search Over Data Graphs}},
booktitle = {19th International Conference on Database Theory (ICDT 2016)},
pages = {23:1--23:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-002-6},
ISSN = {1868-8969},
year = {2016},
volume = {48},
editor = {Martens, Wim and Zeume, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.23},
URN = {urn:nbn:de:0030-drops-57923},
doi = {10.4230/LIPIcs.ICDT.2016.23},
annote = {Keywords: Keyword search over data graphs, subtree enumeration by height, top-k answers, efficiency}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing