Search Results - Computer Science - Databases

Corrections to “On the data complexity of consistent query answering over graph databases [Journal of Computer and System Sciences 88 (2017) 164–194]” by Barceló, Pablo, Fontaine, Gaëlle, Salvati, Sylvain, Tison, Sophie

“…Applications of graph databases are prone to inconsistency due to interoperability issues…”
Get full text

Mind the Gap: Understanding Coverage Breaks of Newly Launched Engineering and Computer Science Journals in Core Databases by Zhang, Yuening, Yu, Dylan

“…Journal coverage is an important factor to consider when evaluating a database. In this study, we counted the number of articles…”
Get full text

Software for pest-management science: computer models and databases from the United States Department of Agriculture-Agricultural Research Service by Wauchope, R Don, Ahuja, Lajpat R, Arnold, Jeffrey G, Bingner, Ron, Lowrance, Richard, van Genuchten, Martinus T, Adams, Larry D

“…We present an overview of USDA Agricultural Research Service (ARS) computer models and databases related to pest…”
Get full text

Infinite Probabilistic Databases by Grohe, Martin, Lindner, Peter

“…Probabilistic databases (PDBs) model uncertainty in data in a quantitative way. In the established formal framework, probabilistic (relational…”
Get full text

Is DBLP a Good Computer Science Journals Database? by Rosenfeld, Ariel

“…DBLP provides comprehensive and free computer science (CS) bibliographic data to all. But how well does it really cover CS journals…”
Get full text

The Shapley Value of Inconsistency Measures for Functional Dependencies by Livshits, Ester, Kimelfeld, Benny

“…Quantifying the inconsistency of a database is motivated by various goals including reliability estimation for new datasets and progress indication in data cleaning…”
Get full text

Enumerating Answers to First-Order Queries over Databases of Low Degree by Durand, Arnaud, Schweikardt, Nicole, Segoufin, Luc

“…A class of relational databases has low degree if for all$\delta>0$ , all but finitely many databases in the class have degree at most$n^{\delta}$ , where$n…”
Get full text

Ranked Enumeration of Conjunctive Query Results by Deep, Shaleen, Koutris, Paraschos

“…We study the problem of enumerating answers of Conjunctive Queries ranked according to a given ranking function. Our main contribution is a novel algorithm…”
Get full text

Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries by Figueira, Diego, Morvan, Rémi

“…We show that the problem of whether a query is equivalent to a query of tree-width$k$is decidable, for the class of Unions of Conjunctive Regular Path Queries…”
Get full text

Linear Programs with Conjunctive Database Queries by Capelli, Florent, Crosetti, Nicolas, Niehren, Joachim, Ramon, Jan

“…In this paper, we study the problem of optimizing a linear program whose variables are the answers to a conjunctive query. For this we propose the language…”
Get full text

A Simple Algorithm for Consistent Query Answering under Primary Keys by Figueira, Diego, Padmanabha, Anantha, Segoufin, Luc, Sirangelo, Cristina

“… whether it evaluates to true over all repairs of a given inconsistent database) is either polynomial time or coNP-complete…”
Get full text

Robustness against Read Committed for Transaction Templates with Functional Constraints by Vandevoort, Brecht, Ketsman, Bas, Koch, Christoph, Neven, Frank

“…The popular isolation level Multiversion Read Committed (RC) trades some of the strong guarantees of serializability for increased transaction throughput…”
Get full text

Decidability of Querying First-Order Theories via Countermodels of Finite Width by Feller, Thomas, Lyon, Tim S., Ostropolski-Nalewaja, Piotr, Rudolph, Sebastian

“…We propose a generic framework for establishing the decidability of a wide range of logical entailment problems (briefly called querying), based on the…”
Get full text

A Trichotomy for Regular Trail Queries by Martens, Wim, Niewerth, Matthias, Popp, Tina

“… In order to avoid having to consider infinitely many paths, some database engines restrict such paths to be trails, that is, they only consider paths without repeated edges…”
Get full text

Conjunctive Queries with Free Access Patterns under Updates by Kara, Ahmet, Nikolic, Milos, Olteanu, Dan, Zhang, Haozhe

“…We study the problem of answering conjunctive queries with free access patterns (CQAPs) under updates. A free access pattern is a partition of the free…”
Get full text

Refl-Spanners: A Purely Regular Approach to Non-Regular Core Spanners by Schmid, Markus L., Schweikardt, Nicole

“…The regular spanners (characterised by vset-automata) are closed under the algebraic operations of union, join and projection, and have desirable algorithmic…”
Get full text

Diversity of Answers to Conjunctive Queries by Merkl, Timo Camillo, Pichler, Reinhard, Skritek, Sebastian

“…Enumeration problems aim at outputting, without repetition, the set of solutions to a given problem instance. However, outputting the entire solution set may…”
Get full text

The Shapley Value of Tuples in Query Answering by Livshits, Ester, Bertossi, Leopoldo, Kimelfeld, Benny, Sebag, Moshe

“…We investigate the application of the Shapley value to quantifying the contribution of a tuple to a query answer. The Shapley value is a widely known numerical…”
Get full text

The Complexity of Aggregates over Extractions by Regular Expressions by Doleschal, Johannes, Kimelfeld, Benny, Martens, Wim

“…Regular expressions with capture variables, also known as regex-formulas, extract relations of spans (intervals identified by their start and end indices) from…”
Get full text

Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries by Bringmann, Karl, Carmeli, Nofar

“…We study the enumeration of answers to Unions of Conjunctive Queries (UCQs) with optimal time guarantees. More precisely, we wish to identify the queries that…”
Get full text