output
20002026
most citedSoftware development in startup companies: A systematic mapping study

416 citations

Showing cs.DBShow all

20 papers · 1 filter

cs.DB2025★ 5 cited

Common Foundations for SHACL, ShEx, and PG-Schema

S. Ahmetaj, I. Boneva, J. Hidders +11

Graphs have emerged as an important foundation for a variety of applications, including capturing and reasoning over factual knowledge, semantic data integration, social networks,…

cs.DB2024★ 6 cited

Generating the Traces You Need: A Conditional Generative Model for Process Mining Data

Riccardo Graziosi, Massimiliano Ronzani, Andrei Buliga +5

In recent years, trace generation has emerged as a significant challenge within the Process Mining community. Deep Learning (DL) models have demonstrated accuracy in reproducing th…

cs.DB2022★ 77 cited

PG-Schema: Schemas for Property Graphs

Renzo Angles, Angela Bonifati, Stefania Dumbrava +18

Property graphs have reached a high level of maturity, witnessed by multiple robust graph database systems as well as the ongoing ISO standardization effort aiming at creating a ne…

cs.DB2018

A Similarity Measure for Weaving Patterns in Textiles

Sven Helmer, Vuong M. Ngo

We propose a novel approach for measuring the similarity between weaving patterns that can provide similarity-based search functionality for textile archives. We represent textile…

cs.DB2018★ 1 cited

Modeling and In-Database Management of Relational, Data-Aware Processes (Extended Version)

Diego Calvanese, Marco Montali, Fabio Patrizi +1

During the last two decades, it has been increasingly acknowledged that the engineering of information systems usually requires a huge effort in integrating master data and busines…

cs.DB2017★ 5 cited

TK: The Twitter Top-K Keywords Benchmark

Ciprian-Octavian Truică, Jérôme Darmont

Information retrieval from textual data focuses on the construction of vocabularies that contain weighted term tuples. Such vocabularies can then be exploited by various text analy…

cs.DB2017★ 3 cited

The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries

Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov +3

Our concern is the overhead of answering OWL 2 QL ontology-mediated queries (OMQs) in ontology-based data access compared to evaluating their underlying tree-shaped and bounded tre…

cs.DB2016★ 103 cited

Predicting Completeness in Knowledge Bases

Luis Galárraga, Simon Razniewski, Antoine Amarilli +1

Knowledge bases such as Wikidata, DBpedia, or YAGO contain millions of entities and facts. In some knowledge bases, the correctness of these facts has been evaluated. However, much…

cs.DB2016

DB-Nets: on The Marriage of Colored Petri Nets and Relational Databases

Marco Montali, Andrey Rivkin

The integrated management of business processes and mas- ter data is being increasingly considered as a fundamental problem, by both the academia and the industry. In this position…

cs.DB2016

Enabling Fine-grained RDF Data Completeness Assessment

Fariz Darari, Simon Razniewski, Radityo Eko Prasojo +1

Nowadays, more and more RDF data is becoming available on the Semantic Web. While the Semantic Web is generally incomplete by nature, on certain topics, it already contains complet…

cs.DB2015

Query Stability in Monotonic Data-Aware Business Processes [Extended Version]

Ognjen Savkovic, Elisa Marengo, Werner Nutt

Organizations continuously accumulate data, often according to some business processes. If one poses a query over such data for decision support, it is important to know whether th…

cs.DB2015★ 5 cited

Lossless Selection Views under Conditional Domain Constraints

Ingo Feinerer, Enrico Franconi, Paolo Guagliardo

A set of views defined by selection queries splits a database relation into sub-relations, each containing a subset of the original rows. This decomposition into horizontal fragmen…

cs.DB2015

Mapping-equivalence and oid-equivalence of single-function object-creating conjunctive queries

Angela Bonifati, Werner Nutt, Riccardo Torlone +1

Conjunctive database queries have been extended with a mechanism for object creation to capture important applications such as data exchange, data integration, and ontology-based d…

cs.DB2014★ 30 cited

Verifiable UML Artifact-Centric Business Process Models (Extended Version)

Diego Calvanese, Marco Montali, Montserrat Estanol +1

Artifact-centric business process models have gained increasing momentum recently due to their ability to combine structural (i.e., data related) with dynamical (i.e., process rela…

cs.DB2014★ 2 cited

Updating RDFS ABoxes and TBoxes in SPARQL

Albin Ahmeti, Diego Calvanese, Axel Polleres

Updates in RDF stores have recently been standardised in the SPARQL 1.1 Update specification. However, computing answers entailed by ontologies in triple stores is usually treated…

cs.DB2012

Answering Queries using Views over Probabilistic XML: Complexity and Tractability

Bogdan Cautis, Evgeny Kharlamov

We study the complexity of query answering using views in a probabilistic XML setting, identifying large classes of XPath queries -- with child and descendant navigation and predic…

cs.DB2012★ 2 cited

Verification of Relational Data-Centric Dynamic Systems with External Services

Babak Bagheri Hariri, Diego Calvanese, Giuseppe De Giacomo +2

Data-centric dynamic systems are systems where both the process controlling the dynamics and the manipulation of data are equally central. In this paper we study verification of (f…

cs.DB2011★ 36 cited

RTED: A Robust Algorithm for the Tree Edit Distance

Mateusz Pawlik, Nikolaus Augsten

We consider the classical tree edit distance between ordered labeled trees, which is defined as the minimum-cost sequence of node edit operations that transform one tree into anoth…

cs.DB2006

Complexity of Consistent Query Answering in Databases under Cardinality-Based and Incremental Repair Semantics

Andrei Lopatenko, Leopoldo Bertossi

Consistent Query Answering (CQA) is the problem of computing from a database the answers to a query that are consistent with respect to certain integrity constraints that the datab…

cs.DB2005★ 1 cited

Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints

L. Bertossi, L. Bravo, E. Franconi +1

Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma…