A5011691423- Advanced Database Systems and Queries
- Semantic Web and Ontologies
- Data Management and Algorithms
- Logic, Reasoning, and Knowledge
- Graph Theory and Algorithms
- Bayesian Modeling and Causal Inference
- Service-Oriented Architecture and Web Services
- Data Quality and Management
- Machine Learning and Algorithms
- Natural Language Processing Techniques
- Scientific Computing and Data Management
- Explainable Artificial Intelligence (XAI)
- Logic, programming, and type systems
- Algorithms and Data Compression
- Complexity and Algorithms in Graphs
- Biomedical Text Mining and Ontologies
- semigroups and automata theory
- Formal Methods in Verification
- Advanced Graph Neural Networks
- Distributed systems and fault tolerance
- Topic Modeling
- Adversarial Robustness in Machine Learning
- Data Mining Algorithms and Applications
- Distributed and Parallel Computing Systems
- Big Data and Business Intelligence
Pontificia Universidad Católica de Chile
2016-2025
Pontificia Universidad Católica de Valparaíso
2008-2024
Millennium Institute
2020-2021
Institute of Materials Finishing
2021
Millennium Institute for Integrative Biology
2021
University of Oxford
2013-2014
University of Toronto
2001-2005
Stony Brook University
2000
SPARQL is the standard language for querying RDF data. In this article, we address systematically formal study of database aspects SPARQL, concentrating in its graph pattern matching facility. We provide a compositional semantics core part and complexity evaluation several fragments language. Among other results, show that general patterns PSPACE-complete. identify large class patterns, defined by imposing simple natural syntactic restriction, where query problem can be solved more...
Article Free Access Share on Consistent query answers in inconsistent databases Authors: Marcelo Arenas Pontificia Universidad Católica de Chile, Escuela Ingeniería, Departamento Ciencia Computación, Casilla 306, Santiago 22, Chile ChileView Profile , Leopoldo Bertossi Jan Chomicki Monmouth University, Department of Computer Science, West Long Branch, NJ NJView Authors Info & Claims PODS '99: Proceedings the eighteenth ACM SIGMOD-SIGACT-SIGART symposium Principles database systemsMay 1999...
Ensuring the success of big graph processing for next decade and beyond.
This article takes a first step towards the design and normalization theory for XML documents. We show that, like relational databases, documents may contain redundant information, be prone to update anomalies. Furthermore, such problems are caused by certain functional dependencies among paths in document. Our goal is find way of converting an arbitrary DTD into well-designed one, that avoids these problems. introduce concept dependency XML, define its semantics via representation XML. then...
We consider the problem of mapping data in peer-to-peer data-sharing systems. Such systems often rely on use tables listing pairs corresponding values to search for residing different peers. In this paper, we address semantic and algorithmic issues related tables. begin by arguing why are appropriate a environment. discuss alternative semantics these present language that allows user specify under semantics. Then, show treating as constraints (called constraints) exchange information between...
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, likely that most the data in consistent with In this paper we apply logic programming based on answer sets to problem retrieving information from possibly database. Since persists original every its minimal repairs, approach specification repairs using disjunctive programs exceptions, whose semantics can be represented and computed by systems implement stable model semantics....
We present an architecture and a set of challenges for peer database management systems. These systems team up to build network nodes (peers) that coordinate at run time most the typical DBMS tasks such as querying, updating, sharing data. Such works in way similar conventional multidatabases. Conventional multidatabase are founded on key concepts those global schema, central administrative authority, data integration, access multiple databases, permanent participation etc. Instead, our...
Mapping relational databases to RDF is a fundamental problem for the development of Semantic Web. We present solution, inspired by draft methods defined W3C where are directly mapped and OWL. Given database schema its integrity constraints, this direct mapping produces an OWL ontology, which, provides basis generating instances. The semantics using Datalog. Two properties information preservation query preservation. prove that our satisfies both conditions, even contain null values. also...
The Semantic Web is the initiative of W3C to make information on readable not only by humans but also machines. RDF data model for data, and SPARQL standard query language this model. In last ten years, we have witnessed a constant growth in amount available Web, which motivated theoretical study some fundamental aspects development efficient mechanisms implementing language.
We report on a community effort between industry and academia to shape the future of graph query languages. argue that existing database management systems should consider supporting language with two key characteristics. First, it be composable, meaning, graphs are input output queries. Second, treat paths as first-class citizens. Our result is G-CORE, powerful design fulfills these goals, strikes careful balance path expressivity evaluation complexity.
SPARQL -the standard query language for querying RDF- provides only limited navigational functionalities, although these features are of fundamental importance graph data formats such as RDF. This has led the W3C to include property path feature in upcoming version standard, 1.1.We tested several implementations 1.1 handling queries, and we observed that their evaluation methods this class queries have a poor performance even some very simple scenarios. To formally explain fact, conduct...
Data exchange is the problem of finding an instance a target schema, given source schema and specification relationship between target. Theoretical foundations data have recently been investigated for relational data.In this paper, we start looking into basic properties XML exchange, that is, restructuring documents conform to DTD under DTD, answering queries written over schema. We define settings in which source-to-target dependencies refer hierarchical structure data. Combining DTDs makes...
Data exchange is the problem of finding an instance a target schema, given source schema and specification relationship between target. Theoretical foundations data have recently been investigated for relational data. In this article, we start looking into basic properties XML exchange, that is, restructuring documents conform to DTD under DTD, answering queries written over schema. We define settings in which source-to-target dependencies refer hierarchical structure Combining DTDs makes...
The problem of querying RDF data is a central issue for the development Semantic Web. query language SPARQL has become standard RDF, since its standardization in 2008. However, 2008 version this missed some important functionalities: reasoning capabilities to deal with RDFS and OWL vocabularies, navigational exploit graph structure data, general form recursion much needed express natural queries. To overcome these limitations, new SPARQL, called 1.1, was recently released, which includes...
This paper takes a first step towards the design and normalization theory for XML documents. We show that, like relational databases, documents may contain redundant information, be prone to update anomalies. Furthermore, such problems are caused by certain functional dependencies among paths in document. Our goal is find way of converting an arbitrary DTD into well-designed one, that avoids these problems. introduce concept dependency XML, define its semantics via representation XML. then...