yusuke1997/dblp-id-title huggingface dataset:
Containment of conjunctive queries on annotated relations
Communication Cost of Joins over Federated Data
Learning schema mappings
A personal perspective on keyword search over data graphs
Optimizing Active Databases using the Split Technique
Which DTDs are streaming bounded repairable?
Facets of Probabilistic Databases (Invited Talk)
Idempotent Single-Predicate Horn Clauses
On the Hardness of Category Tree Construction
Some Extensions to the Closed World Assumption in Databases
Abstract Interpretation of Active Rules and its Use in Termination Analysis
Ask a Better Question, Get a Better Answer A New Approach to Private Data Analysis
k-Regret Minimizing Set: Efficient Algorithms and Hardness
Correspondence and Translation for Heterogeneous Data
Reasoning about XML Constraints based on XML-to-relational mappings
Generalized Covers for Conjunctive Queries
An Experimental Study of the Treewidth of Real-World Graph Data
Semantics and Containment with Internal and External Conjunctions
Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk)
The complexity of rooted phylogeny problems
Characterization of the Interaction of XML Functional Dependencies with DTDs
Containment of Regular Path Queries Under Path Constraints
Database Theory - ICDT '99, 7th International Conference, Jerusalem, Israel, January 10-12, 1999, Proceedings
A Simple Algorithm for Worst Case Optimal Join and Sampling
Beauty and the Beast: The Theory and Practice of Information Integration
Top-k Querying of Unknown Values under Order Constraints
Data Exchange: Semantics and Query Answering
A theoretical study of 'Snapshot Isolation'
When Do Homomorphism Counts Help in Query Algorithms?
Learning Models over Relational Databases (Invited Talk)
Conceptual Level Concurrency Control of Relational Update Transactions
Increment Boundedness and Nonrecursive Incremental Evaluation of Datalog Queries
On the Orthographic Dimension of Constraint Databases
Aggregate queries for discrete and continuous probabilistic XML
Dynamic Conjunctive Queries
Query Stability in Monotonic Data-Aware Business Processes
Efficient Complete Local Tests for Conjunctive Query Constraints with Negation
Removing Redundancy and Updating Databases
Grammars for Document Spanners
Joint 2013 EDBT/ICDT Conferences, ICDT '13 Proceedings, Genoa, Italy, March 18-22, 2013
Combining dependent annotations for relational algebra
FC-Datalog as a Framework for Efficient String Querying
Access patterns and integrity constraints revisited
Graph pattern matching revised for social network analysis
Database Theory in Action: Search-Based Program Optimization
Representing Data as Resources in RDF and OWL
On the equivalence of distributed systems with queries and communication
Covers of Query Results
Query Repairs
Satisfiability for SCULPT-Schemas for CSV-Like Data
Optimization of Query Plans in the presence of Access Limitations
Subgraph Enumeration in Optimal I/O Complexity
In Search of the Lost Schema
Asymptotically Optimal Declustering Schemes for Range Queries
A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs
Tuple-Generating Dependencies Capture Complex Values
On The I/O Complexity of Dynamic Distinct Counting
Regular Queries on Graph Databases
Semantic Information Connected with Data
Optimizing Large Join Queries in Mediation Systems
Conjunctive Queries with Free Access Patterns Under Updates
The Confounding Problem of Private Data Release (Invited Talk)
On the tractability of query compilation and bounded treewidth
From polynomial time queries to graph structure theory
Games for Active XML Revisited
Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls
Diversity of Answers to Conjunctive Queries
The Complexity of Aggregates over Extractions by Regular Expressions
Horizontal Decompositions Based on Functional-Dependency-Set-Implications
Exact XML Type Checking in Polynomial Time
The Free Termination Property of Queries over Time
Tableau Techniques for Querying Information Sources through Global Schemas
An Active Web-based Distributed Database System for E-Commerce
28th International Conference on Database Theory, ICDT 2025, Barcelona, Spain, March 25-28, 2025
A propagation model for provenance views of public/private workflows
Algorithms for Provisioning Queries and Analytics
Hierarchical Summarizing and Evaluating for Web Pages
On the Power of Stratified Logic Programs with Value Invention for Expressing Database Transformations
Finite-Model Theory - a Personal Perspective
Learning Definable Hypotheses on Trees
Towards Streaming Evaluation of Queries with Correlation in Complex Event Processing
A First Step Towards Implementing Dynamic Algebraic Dependencies
Learning of Ontologies from the Web: the Analysis of Existent Approaches
Answering Unions of Conjunctive Queries with Ideal Time Guarantees (Invited Talk)
On the Complexity of Queries in the Logical Data Model (Extended Abstract)
When Can Matrix Query Languages Discern Matrices?
Reasoning about Summarizability in Heterogeneous Multidimensional Schemas
Parallel-Correctness and Transferability for Conjunctive Queries under Bag Semantics
Conjunctive Query Evaluation by Search Tree Revisited
Enumeration Algorithms for Conjunctive Queries with Projection
Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection
Definability and Descriptive Complexity on Databases of Bounded Tree-Width
Counting Database Repairs that Satisfy Conjunctive Queries with Self-Joins
Process-Centric Views of Data-Driven Business Artifacts
26th International Conference on Database Theory, ICDT 2023, Ioannina, Greece, March 28-31, 2023
Database Theory in Russia (1979-1991) (an overview)
Worst-Case Optimal Algorithms for Parallel Query Processing
Preserving Constraints with the Stable Chase
Finding K Optimum Edit Scripts between an XML Document and a RegularTree Grammar
Comparing workflow specification languages: a matter of views
Reformulation of XML Queries and Constraints
Datalog Queries Distributing over Components
Which XML Schemas Admit 1-Pass Preorder Typing?
A Flexible and Adaptable Tool Kit Approach for Concurrency Control in Non Standard Database Systems
Computing universal models under guarded TGDs
Approximation and Semantic Tree-Width of Conjunctive Regular Path Queries
Coupling Fragments of XPath with XML Indexing and Query Decomposition
Quantum Data Sketches
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
The First Order Truth Behind Undecidability of Regular Path Queries Determinacy
Data correspondence, exchange and repair
Anonymizing Tables
FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies
A Rewriting Technique for the Analysis and the Optimization of Active Databases
Entity-Relationship Consistency for Relational Schemas
Deciding Boundedness for Uniformly Connected Datalog Programs
Combining Temporal Logics for Querying XML Documents
A normal form for preventing redundant tuples in relational databases
Proceedings of the First International Workshop on Web Dynamics, WebDyn@ICDT 2001, London, UK, January 3, 2001
A logical account of uncertain databases based on linear logic
Description Logics and Their Relationships with Databases
Database Repairing with Soft Functional Dependencies
Issues Raised by Three Years of Developing PJama: An Orthogonally Persistent Platform for Java
Conjunctive Query Containment Revisited
Tractable Iteration Mechanisms for Bag Languages
Algebraic structures for capturing the provenance of SPARQL queries
A More General Theory of Static Approximations for Conjunctive Queries
Direct Access for Conjunctive Queries with Negations
On the Complexity of Mining Itemsets from the Crowd Using Taxonomies
The Complexity of Reverse Engineering Problems for Conjunctive Queries
Ranked Enumeration of Conjunctive Query Results
Efficient data structures for range-aggregate queries on trees
Update Semantics under the Domain Closure Assumption
Partition Constraints for Conjunctive Queries: Bounds and Worst-Case Optimal Joins
Logics for Mobility
Compression of Unordered XML Trees
Automatic verification of data-centric business processes
Probabilistic data exchange
An Optimal Algorithm for Sliding Window Order Statistics
Approximate Dependency Inference from Relations
Constant-Delay Enumeration for Nondeterministic Document Spanners
Databases for Tracking Mobile Units in Real Time
Querying graph databases with XPath
Auditing Sum Queries
Local Properties of Query Languages
Faster join-projects and sparse matrix multiplications
An Efficient Indexing Scheme for Multi-dimensional Moving Objects
Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs
Concurrency Control Theory for Deferred Materialized Views
Range Entropy Queries and Partitioning
Dynamic definability
On Answering Queries in the Presence of Limited Access Patterns
Distribution Constraints: The Chase for Distributed Data
SQL's Three-Valued Logic and Certain Answers
A Comparative Analysis of Two-Phase-Commit Protocols
Fine-grained Algorithms and Complexity
Large-Scale Similarity Joins With Guarantees (Invited Talk)
Faster query answering in probabilistic databases using read-once functions
How big must complete XML query languages be?
Categorical Range Reporting with Frequencies
World-Set Decompositions: Expressiveness and Efficient Algorithms
Counting Triangles under Updates in Worst-Case Optimal Time
Box Covers and Domain Orderings for Beyond Worst-Case Join Processing
Sorted HiLog: Sorts in Higher-Order Logic Data Languages
On The Expressive Power of the Relational Calculus with Arithmetic Constraints
Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
Optimal Joins Using Compact Data Structures
Beyond Logarithmic Bounds: Querying in Constant Expected Time with Learned Indexes
Increasing the Expressiveness of Analytical Performance Models for Replicated Databases
Improving the Concurrency of Integrity Checks and Write Operations
Declarative Foundations of Secure Deductive Databases
Hubs and Authorities: Spreading Out and Zooming In
Executable First-Order Queries in the Logic of Information Flows
On Efficient Range-Summability of IID Random Variables in Two or Higher Dimensions
Incremental XPath evaluation
Synthesizing transformations from XML schema mappings
Beyond Well-designed SPARQL
Solutions in XML data exchange
Satisfiability algorithms for conjunctive queries over trees
Querying the Unary Negation Fragment with Regular Path Expressions
Database Theory in Action: Cypher, GQL, and Regular Path Queries
Foundations of SPARQL query optimization
On Finding Extensions of Default Theories
Conjectures and Refutations in Database Design and Dependency Theory
Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability
Natural Language Data Interfaces: A Data Access Odyssey (Invited Talk)
Enumerating with constant delay the answers to a query
Provenance for database transformations
Expressive Power of Entity-Linking Frameworks
The Space Complexity of Inner Product Filters
Entropy Bounds for Conjunctive Queries with Functional Dependencies
Artifact systems with data dependencies and arithmetic
Introduction to the Theory of Nested Transactions
Hypothetical Datalog: Complexity and Expressiblity
On the Composition and Decomposition of Datalog Program Mappings
The Smart Crowd - Learning from the Ones Who Know (Invited Talk)
View Update Translation via Deduction and Annotation
Efficient Voting Protocols with Witnesses
Fast Sketch-based Recovery of Correlation Outliers
Type-Consistency Problems for Queries in Object-Oriented Databases
Set Containment Inference
Answering Conjunctive Queries with Inequalities
PTIME Queries Revisited
Database Query Processing Using Finite Cursor Machines
Maintaining Dictionaries: Space-Saving Modifications of B-Trees
Validating XML documents in the streaming model with external memory
Distribution Policies for Datalog
On the Expressive Power of Linear Algebra on Graphs
Some Vignettes on Subgraph Counting Using Graph Orientations (Invited Talk)
Datalog Rewritings of Regular Path Queries using Views
Conjunctive queries determinacy and rewriting
Optimal Oblivious Algorithms for Multi-Way Joins
Querying parse trees of stochastic context-free grammars
Structural Issues in Active Rule Systems
Approximating Distance Measures for the Skyline
23rd International Conference on Database Theory, ICDT 2020, Copenhagen, Denmark, March 30 - April 2, 2020
Proceedings of the 1st Workshop on Emerging Research Opportunities for Web Data Management (EROW 2007) Collocated with the 11th International Conference on Database Theory (ICDT 2007), Barcelona, Spain, January 13, 2007
Dynamic Graph Queries
A Purely Regular Approach to Non-Regular Core Spanners
Expressiveness Issues and Decision Problems for Active Database Event Queries
A Researcher's Digest of GQL (Invited Talk)
Constraint-based clustering in large databases
A Theory of Specialization Constraints for Complex Objects
Integrating XQuery and P2P in MonetDB/XQuery*
19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15-18, 2016
Characterising Fixed Parameter Tractability for Query Evaluation over Guarded TGDs
Expressivity and Complexity of MongoDB Queries
A New Characterization of Distributed Deadlock in Databases
Unified Transaction Model for Semantically Rich Operations
Oblivious Query Processing
Fast Search & Transfer ASA
Massively Parallel Entity Matching with Linear Classification in Low Dimensional Space
Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers, List of Authors
Magic Sets and Their Application to Data Integration
Database Theory in Action: Database Visualization
Uniformly-Distributed Random Generation of Join Orders
Determinacy and Rewriting of Conjunctive Queries Using Views: A Progress Report
A Hierarchy of Faithful Set Creation in Pure OODB's
21st International Conference on Database Theory, ICDT 2018, Vienna, Austria, March 26-29, 2018
The Consistency of Probabilistic Databases with Independent Cells
Flexible Data Cubes for Online Aggregation
XML Schema Mappings in the Presence of Key Constraints and Value Dependencies
Update Serializability in Locking
Set-Term Matching in Logic Programming
Optimization Using Tuple Subsumption
Condensed Representation of Database Repairs for Consistent Query Answering
Enumeration Complexity of Conjunctive Queries with Functional Dependencies
Maintaining Bounded Disorder Files in Multiprocessor Multi-Disk Environments
Learning Tree Patterns from Example Graphs
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation
WELL!: An Evaluation Procedure for All Logic Programs
Detecting and exploiting near-sortedness for efficient relational query evaluation
The Shapley Value of Inconsistency Measures for Functional Dependencies
Locality-Aware Distribution Schemes
Well Founded Semantics and Stable Semantics of Semi-Strict Programs
Logic Programming and Parallel Complexity
A Stable Model Semantics for Behavioral Inheritance in Deductive Object Oriented Languages
When Is ''Nearest Neighbor'' Meaningful?
Database Theory - ICDT 2011, 14th International Conference, Uppsala, Sweden, March 21-24, 2011, Proceedings
Efficient Differentially Private F₀ Linear Sketching
Approximations in Database Systems
On optimum left-to-right strategies for active context-free games
O(1)-Round MPC Algorithms for Multi-Dimensional Grid Graph Connectivity, Euclidean MST and DBSCAN
Database Theory - ICDT 2005, 10th International Conference, Edinburgh, UK, January 5-7, 2005, Proceedings
Queries with External Predicates
Tractability in probabilistic databases
Using Locality for Efficient Query Evaluation in Various Computation Models (Invited Talk)
Declarative Probabilistic Programming with Datalog
Parallel Acyclic Joins with Canonical Edge Covers
A Simple Algorithm for Consistent Query Answering Under Primary Keys
How Many Variables Are Needed to Express an Existential Positive Query?
Probabilistic Interval XML
The Generalized Counting Method for Recursive Logic Queries
Rewriting Queries Using Views with Access Patterns Under Integrity Constraints
The Design of Arbitrage-Free Data Pricing Schemes
Open Problems in Data-Sharing Peer-to-Peer Systems
Degree Sequence Bound for Join Cardinality Estimation
22nd International Conference on Database Theory, ICDT 2019, Lisbon, Portugal, March 26-28, 2019
Maximum Coverage in the Data Stream Model: Parameterized and Generalized
Distributed Streaming with Finite Memory
Using the crowd for top-k and group-by queries
Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014
Efficient Management of Replicated Data
Updating Atomic Information in Labelled Database Systems
Simplifying schema mappings
Expressiveness of SHACL Features
Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity
(Approximate) uncertain skylines
TOP-K projection queries for probabilistic business processes
Additive First-Order Queries
Beginnings of a Theory of General Database Completions
Anchor-Points Algorithms for Hamming and Edit Distances Using MapReduce
Typechecking Top-Down Uniform Unranked Tree Transducers
A Probabilistic Approach to Model Adaptive Hypermedia Systems
Containment of Conjunctive Queries over Databases with Null Values
Private decayed predicate sums on streams
Efficient Consistency Control in Deductive Databases
Information Inequality Problem over Set Functions
Targeted Least Cardinality Candidate Key for Relational Databases
Delta-Languages for Sets and sub-PTIME Graphs Transformers
Deduction with Contradictions in Datalog
Axiomatization of Frequent Sets
Database Theory - ICDT 2007, 11th International Conference, Barcelona, Spain, January 10-12, 2007, Proceedings
Data Management Perspectives on Prescriptive Analytics (Invited Talk)
Partial Strictness in Two-Phase Locking
Database Theory - ICDT 2001, 8th International Conference, London, UK, January 4-6, 2001, Proceedings
Constant-Delay Enumeration for SLP-Compressed Documents
The Limits of Querying Ontologies
A Paradox in Database Theory
Selecting and Using Views to Compute Aggregate Queries (Extended Abstract)
The Complexity of Width Minimization for Existential Positive Queries
Links between Join Processing and Convex Geometry
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
On the data complexity of consistent query answering
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries
On Horn Axiomatizations for Sequential Data
A Dichotomy on the Complexity of Consistent Query Answering for Atoms with Simple Keys
Complexity of Consistent Query Answering in Databases Under Cardinality-Based and Incremental Repair Semantics
Optimal Workload-Based Weighted Wavelet Synopses
Boolean Tensor Decomposition for Conjunctive Queries with Negation
Update in Hierarchical Data Bases
Filtering With the Crowd: CrowdScreen Revisited
Database Theory - ICDT'92, 4th International Conference, Berlin, Germany, October 14-16, 1992, Proceedings
XML compression via DAGs
Languages for Polynomial-Time Queries - An Ongoing Quest
Containment of UC2RPQ: The Hard and Easy Cases
A Dyadic Simulation Approach to Efficient Range-Summability
Enumeration on Trees under Relabelings
An Evaluation Model for Clustering Strategies in the O2 Object-Oriented Database System
Decidable Containment of Recursive Queries
The Average Length of Keys and Functional Dependencies in (Random) Databases
Basic Model Theory of XPath on Data Trees
Index Structures for Path Expressions
The Theory of Zeta Graphs with an Application to Random Networks
Verification of Evolving Graph-structured Data under Expressive Path Constraints
Join Sampling Under Acyclic Degree Constraints and (Cyclic) Subgraph Sampling
Querying probabilistic business processes for sub-flows
Asymptotic Determinacy of Path Queries using Union-of-Paths Views
On Capturing First-Order Topological Properties of Planar Spatial Databases
Scalar Aggregation in FD-Inconsistent Databases
Serializability of Nested Transactions in Multidatabases
Datalog: Bag Semantics via Set Semantics
Incremental Validation of XML Documents
It's All a Matter of Degree: Using Degree Information to Optimize Multiway Joins
Distributed Query Monitoring through Convex Analysis: Towards Composable Safe Zones
Towards Aggregated Answers for Semistructured Data
Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases
The ICDT 2014 Test of Time Award
Complexity of Typechecking XML Views of Relational Databases
Learning Tree Pattern Transformations
Reasoning About Integrity Constraints for Tree-Structured Data
Representing Object Identity in a Pure Functional Language
An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs
Data Models and Languages for Databases
On the Automated Verification of Web Applications with Embedded SQL
Coordination-Free Byzantine Replication with Minimal Communication Costs
New Algorithms for Heavy Hitters in Data Streams (Invited Talk)
A Model Theoretic Approach to Update Rule Programs
Evaluating Graph Queries Using Semantic Treewidth
On Materializing Views and On-Line Queries
PAC: Computing Join Queries with Semi-Covers
An Abstract Framework for Generating Maximal Answers to Queries
Composing local-as-view mappings: closure and applications
On Reasoning about Structural Equality in XML: A Description Logic Approach
Query Languages with Counters
Query Evaluation on a Database Given by a Random Graph
Efficient Algorithms for Managing the History of Evolving Databases
Database Theory - ICDT '97, 6th International Conference, Delphi, Greece, January 8-10, 1997, Proceedings
Infinite Probabilistic Databases
Split-Freedom and MVD-Intersection: A New Characterization of Multivalued Dependencies Having Conflict-Free Covers
Query Processing in Incomplete Logical Databases
Consistent Query Answering for Primary Keys and Conjunctive Queries with Counting
Database Theory - ICDT 2009, 12th International Conference, St. Petersburg, Russia, March 23-25, 2009, Proceedings
Adding Structure to Unstructured Data
Circuits for Datalog Provenance
Right-Adjoints for Datalog Programs
A Formal Language Perspective on Factorized Representations
On the Expressiveness of Languages for Complex Event Recognition
Dynamic Processing of Dominating Queries with Performance Guarantees
Cost Based Data Dissemination in Broadcast Networks with Disconnection
Efficient Indexing for Constraint and Temporal Databases
How Do Centrality Measures Choose the Root of Trees?
Factorised representations of query results: size bounds and readability
Answer Counting Under Guarded TGDs
Tight results for clustering and summarizing data streams
Containment of Conjunctive Queries with Safe Negation
Multidimensional Order Preserving Linear Hashing with Partial Expansions
Algorithms for the Database Layout Problem
Probabilistic Query Evaluation with Bag Semantics
Annotations are relative
Characterizing XML Twig Queries with Examples
From Causes for Database Queries to Repairs and Model-Based Diagnosis and Back
Direct Access for Answers to Conjunctive Queries with Aggregation
The PADS project: an overview
Playing Games with Objects
Combining Incompleteness and Ranking in Tree Queries
Synthesizing view definitions from data
Oblivious Chase Termination: The Sticky Case
Semantics of Types for Database Objects
DATALOG Queries with Stratified Negation and Choice: from P to D P
Tutorial on Parallel Database Systems
Subsumption for XML types
Conditional Independence on Semiring Relations
A Domain Theoretic Approach to Higher-Order Relations
Linear Programs with Conjunctive Queries
Domain-Independent Queries on Databases with External Functions
Complexity of Repair Checking and Consistent Query Answering
Rule-Based Ontologies: From Semantics to Syntax (Invited Talk)
Evaluation and Enumeration Problems for Regular Path Queries
Modelling Large Bases of Categorial Data With Acyclic Schemes
On the Expressiveness of Implicit Provenance in Query and Update Languages
Minimizing Indefinite Information in Disjunctive Deductive Databases
Filtering Data Flow in Deductive Databases
A Theory of Atomic Transactions