yusuke1997/dblp-id-title huggingface dataset:
On the Equivalence of Logical Databases
XML with Data Values: Typechecking Revisited
Group Updates for Relaxed Height-Balanced Trees
Querying Partially Sound and Complete Data Sources
Using Semiouterjoins to Process Queries in Multidatabase Systems
Database Metatheory: Asking the Big Queries
Uniform Operational Consistent Query Answering
Queries with Arithmetic on Incomplete Databases
Pipelining in Multi-Query Optimization
Convergence of Sideways Query Evaluation
Numerical document queries
Dynamic Tree Isomorphism via First-Order Updates
Compiling Query Constraints
Uniform Generation in Spatial Constraint Databases and Applications
On Computing Restricted Projections of Representative Instances
The complexity of XPath query evaluation
Non First Normal Form Relations to Represent Hierarchical Organized Data
Complexity of Nonrecursive Logic Programs with Complex Values
Quantifying the Loss of Acyclic Join Dependencies
Lower Bounds for Conjunctive Query Evaluation
Optimization of Real Conjunctive Queries
The ACM PODS Alberto O. Mendelzon test-of-time award 2013
Proceedings of the Fourth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, March 25-27, 1985, Portland, Oregon, USA
Decomposition of Relational Schemata into Components Defined by Both Projection and Restriction
Concurrency Control for Resilient Nested Transactions
Weak Multivalued Dependencies
Specification and Verification of Data-driven Web Services
Generative Datalog with Continuous Distributions
Weighted Reservoir Sampling from Distributed Streams
Corrigendum: Are Few Bins Enough: Testing Histogram Distributions
Incremental View Maintenance For Collection Programming
An Efficient, Fault-Tolerant Protocol for Replicated Data Management
Synapse Approach to Database Recovery
On producing join results early
From information to knowledge: harvesting entities and relationships from web sources
Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 21-23, 1988, Austin, Texas, USA
On Datalog vs. Polynomial Time
Concurrency Control of Nested Transactions Accessing B-Trees
Independence-reducible Database Schemes
Type Inference in the Polymorphic Relational Algebra
What Storage Access Privacy is Achievable with Small Overhead?
Relational Database Behavior: Utilizing Relational Discrete Event Systems and Models
Efficient Matrix Sketching over Distributed Data
Computing cores for data exchange: new algorithms and practical solutions
Using Non-Linear Dynamical Systems for Web Searching and Ranking
Computing all skyline probabilities for uncertain data
Interpolation-Based Index Maintenance
Stackless Processing of Streamed Trees
On Indexing Mobile Objects
On the Power of Rule-Based Languages with Sets
Output-optimal Parallel Algorithms for Similarity Joins
On the Analysis of Indexing Schemes
Sampling Big Ideas in Query Optimization
Containment and Equivalence for an XPath Fragment
Representing and Querying XML with Incomplete Information
Optimal indexing using near-minimal space
Geographic Database Systems: Issues and Research Needs (Abstract)
Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction
Safety of Non-Well-Locked Trasnaction Systems
Satisfiability of downward XPath with data equality tests
The wavelet trie: maintaining an indexed sequence of strings in compressed space
Magic Factoring of Closure Programs
On the Complexity of Optimal K-Anonymity
Conditional XPath, the First Order Complete XPath Dialect
Managing Semantic Heterogeneity in Databases: A Theoretical Perspective
The complexity of reasoning about pattern-based XML schemas
On the Expressive Power of Logic Programming Languages with Sets
On Relational Algebra with Marked Nulls
Two-Attribute Skew Free, Isolated CP Theorem, and Massively Parallel Joins
Querying Websites Using Compact Skeletons
Data Streams with Bounded Deletions
Approximation Algorithms for Large Scale Data Analysis
Explicit Control of Logic Programs Through Rule Algebra
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The Implication and Finite Implication Problems for Typed Template Dependencies
Join-distinct aggregate estimation over update streams
Pan-private algorithms via statistics on sketches
Allocating Isolation Levels to Transactions in a Multiversion Setting
Negation as Failure for First-Order Queries
The chase revisited
Disaggregations in Databases
The White-Box Adversarial Data Stream Model
Polynomial Time Query Processing in Temporal Deductive Databases
Transactions and Integrity Constraints
Inference of Monotonicity Constraints in Datalog Programs
Achieving anonymity via clustering
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems
Concurrent Set Manipulation without Locking
Vertex and Hyperedge Connectivity in Dynamic Graph Streams
Token Transactions: Managing Fine-Grained Migration of Data
Structure and Complexity of Bag Consistency
Joining Extractions of Regular Expressions
Integrating Information by Outerjoins and Full Disjunctions
A Procedural Semantics for Well Founded Negation in Logic Programs
Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31 - June 2, 1999, Philadelphia, Pennsylvania, USA
Queries Are Easier Than You Thought (Probably)
Incremental query evaluation in a ring of databases
Synchronization Schemas
The Inference Problem for Template Dependencies
On the Complexity of Database Queries
Relational transducers for declarative networking
Two-variable logic on data trees and XML reasoning
Optimization of Multiple-Relation Multiple-Disjunct Queries
Research Problems in Genome Databases
Space-Bounded FOIES
Cache-oblivious string B-trees
Computational Aspects of Resilient Data Extraction from Semistructured Sources
Minimum Coresets for Maxima Representation of Multidimensional Data
Substring Selectivity Estimation
Querying Spatial Databases via Topological Invariants
Process Locking: A Protocol based on Ordered Shared Locks for the Execution of Transactional Processes
On the Decomposition of Join Dependencies
Provenance semirings
Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the calm-conjecture
Handling Infinite Temporal Data
New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins
Ranked Enumeration of Minimal Triangulations
Constant Delay Algorithms for Regular Document Spanners
Better Cardinality Estimators for HyperLogLog, PCSA, and Beyond
Nested Transactions and Read/Write Locking
Shortest Paths and Distances with Differential Privacy
Object Migration
Minimizing Time-Space Cost For Database Version Control
Epidemic Algorithms in Replicated Databases (Extended Abstract)
Joins via Geometric Resolutions: Worst-case and Beyond
Fast Algorithms for Parsing Sequences of Parentheses with Few Errors
The Reliability of Queries
Availability in Partitioned Replicated Databases
Managing Rule Conflicts in an Active Database
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, New York, NY, USA - June 22 - 27, 2013
Regularizing Conjunctive Features for Classification
Tractability Beyond ß-Acyclicity for Conjunctive Queries with Negation
New Data Models and Languages - the Challenge
A Query Language for NC
Incorporating constraints in probabilistic XML
The power of two min-hashes for similarity search among hierarchical data objects
Space-efficient substring occurrence estimation
Logical Foundations of Peer-To-Peer Data Integration
Window-Accumulated Subsequence Matching Problem is Linear
The Interpolation-Based Grid File
Database principles in information extraction
2019 ACM PODS Alberto O. Mendelzon Test-of-Time Award
Possibilities and Limitations of Using Flat Operators in Nested Algebra Expressions
The Complexity of Querying Indefinite Data about Linearly Ordered Domains
A Serialization Graph Construction for Nested Transactions
Randomize the Future: Asymptotically Optimal Locally Private Frequency Estimation Protocol for Longitudinal Data
Lower Bounds for Sparse Oblivious Subspace Embeddings
An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems
Fixed-Precision Estimation of Join Selectivity
Database-friendly random projections
On the Complexity and Axiomatizability of Consistent Database States
Approximation algorithms for co-clustering
Expressiveness of Structured Document Query Languages Based on Attribute Grammars
Security analysis of cryptographically controlled access to XML documents
Minimum and Maximum Predicates in Logic Programming
Expressive Power of Linear Algebra Query Languages
Declarative Expression of Deductive Database Updates
Semantic query optimization in the presence of types
Compact Summaries over Large Datasets
Chasing Constrained Tuple-Generating Dependencies
A crash course on database queries
Approximating predicates and expressive queries on probabilistic databases
Bounds on the Propagation of Selection into Logic Programs
The Valid Model Semantics for Logic Programs
A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries
A Query Language Perspective on Graph Learning
Time-decaying aggregates in out-of-order streams
The Precedence-Assignment Model for Distributed Database Concurrency Control Algorithms
Data Integration: After the Teenage Years
Towards a theory of schema-mapping optimization
Will I be Pretty, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering (Summary)
A rigorous and customizable framework for privacy
On Preservation under Homomorphisms and Unions of Conjunctive Queries
The Extended Closed World Assumpution and its Relationship to Parallel Circumscription
Towards Better Bounds for Finding Quasi-Identifiers
How to quickly find a witness
Linear vs. Order Contstrained Queries Over Rational Databases
Model Counting meets F 0 Estimation
Explanations and Transparency in Collaborative Workflows
Positive Active XML
Efficient Query Answering in the Representative Instance Approach
Dependency Characterizations for Acyclic Database Schemes
A Journey to the Frontiers of Query Rewritability
Charting the tractability frontier of certain conjunctive query answering
Stochastic Service Guarantees for Continuous Data on Multi-Zone Disks
Concurrency Control and Recovery in Transactional Process Management
On Verifying Consistency of XML Specifications
Flexible Queries Over Semistructured Data
On Optimizing Summary-Table-by-Example Queries
Data Bases in Digital Libraries: Where Computer Science and Information Management Meet
The Lixto Data Extraction Project - Back and Forth between Theory and Practice
View Maintenance Issues for the Chronicle Data Model
A generic flow algorithm for shared filter ordering problems
Tutorial: Text Dominated Databases, Theory Practice and Experience
Conjunctive Regular Path Queries with String Variables
Making Object-Oriented Schemas More Expressive
On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals
On the Expected Size of Recursive Datalog Queries
Extendible Hashing for Concurrent Operations and Distributed Data
Generative Datalog with Stable Negation
On the decidability and complexity of query answering over inconsistent and incomplete databases
Estimating the Size of Union of Sets in Streaming Models
Attributed Grammars for Query Language Translations
Dynamic Constraints and Database Evolution
On Monotonic Determinacy and Rewritability for Recursive Queries and Views
Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 3-5, Madison, Wisconsin, USA
Optimal and Approximate Computation of Summary Statistics for Range Aggregates
Rewriting Aggregate Queries Using Views
The Complexity of Evaluating Relational Queries
Adding Disjunction to Datalog
Heavy Hitters and the Structure of Local Privacy
Pushing Constraint Selections
On the Expressive Power of Datalog: Tools and a Case Study
Estimating arbitrary subset sums with few probes
Data-Independent Space Partitionings for Summaries
I/O-efficient planar range skyline and attrition priority queues
Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data
Management of probabilistic data: foundations and challenges
Concepts for a Database System Compiler
Algorithms for Translating View Updates to Database Updates for Views Involving Selections, Projections, and Joins
A Normal Form for Nested Relations
Curated databases
Subspace Exploration: Bounds on Projected Frequency Estimation
Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees
Relational Transducers for Electronic Commerce
Tools for Datalog Boundedness
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2023, Seattle, WA, USA, June 18-23, 2023
High Dimensional Differentially Private Stochastic Optimization with Heavy-tailed Data
Power-Conserving Computation of Order-Statistics over Sensor Networks
Deductive Databases in Action
2018 ACM PODS Alberto O. Mendelzon Test-of-Time Award
Dynamic Query Interpretation in Relational Databases
Variability in Data Streams
On nearest neighbor indexing of nonlinear trajectories
Maintenance of Stratified Databases Viewed as a Belief Revision System
Granularity Hierarchies in Concurrency Control
Typechecking for XML Transformers
Efficient Top-k Indexing via General Reductions
Concurrency Control in Database Structures with Relaxed Balance
Efficient and Acurate Cost Models for Parallel Query Optimization
Programmable clustering
Benchmarking Approximate Consistent Query Answering
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries
Database Theory: Past and Future
Towards Tight Bounds for the Streaming Set Cover Problem
Maximizing conjunctive views in deletion propagation
FIFO indexes for decomposable problems
Axiomatization and Simplification Rules for Relational Transactions
Maximal Concurrency by Locking
Range-Max Queries on Uncertain Data
Effective characterizations of tree logics
Data Independent Recursion in Deductive Databases
Model-data Ecosystems: challenges, tools, and trends
Deciding Robustness for Lower SQL Isolation Levels
Semigroup Techniques in Recursive Query Optimization
Partial-Sum Queries in Data Cubes Using Covering Codes
Data Management for Social Networking
Order Preserving Linear Hashing Using Dynamic Key Statistics
Finding near neighbors through cluster pruning
Increasing the Resilience of Atomic Commit at No Additional Cost
Split-Correctness in Information Extraction
Overbound and Right-Linear Queries
Complete Geometrical Query Languages
Quasilinear Algorithms for Processing Relational Calculus Expressions
Inclusion Dependencies and Their Interaction with Functional Dependencies
Answering Queries Using Limited External Processors
Indexing the Edges - A Simple and Yet Efficient Approach to High-Dimensional Indexing
Suppressing Marginal Cells to Protect Sensitive Information in a Two-Dimensional Statistical Table
Distributed and Streaming Linear Programming in Low Dimensions
Magic Conditions
Truly Perfect Samplers for Data Streams and Sliding Windows
Using Witness Generators to Support Bi-directional Update Between Object-Based Databases
Fuzzy Queries in Multimedia Database Systems
Functional and Predicative Programming in OODB's
The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2024
Databases as Graphs: Predictive Queries for Declarative Machine Learning
BonXai: Combining the simplicity of DTD with the expressiveness of XML Schema
Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries
Efficient approximations of conjunctive queries
New results on two-dimensional orthogonal range aggregation in external memory
Entrepreneurship for Information Systems Researchers (Abstract of Invited Tutorial)
Are Few Bins Enough: Testing Histogram Distributions
First-Order Rewritability in Consistent Query Answering with Respect to Multiple Keys
Relational lenses: a language for updatable views
Nearest neighbor searching under uncertainty II
Compatibility and Commutativity in Non-two-phase Locking Protocols
Recovering Exchanged Data
Composable core-sets for diversity and coverage maximization
The Tractability Frontier of Well-designed SPARQL Queries
Path Expressions in Databases
Privacy in data systems
An Improved Algorithm for Finding a Key of a Relation
Finding a minimal tree pattern under neighborhood constraints
Three Modern Roles for Logic in AI
A trichotomy for regular simple path queries on graphs
Ensuring Transaction Atomicity in Multidatabase Systems
Theory of Database Queries
Companion of the 43rd Symposium on Principles of Database Systems, PODS 2024, Santiago, Chile, June 9-15, 2024
An Overview of Query Optimization in Relational Systems
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates
Avoiding Cartesian Products in Programs for Multiple Joins
On the Enumeration Complexity of Unions of Conjunctive Queries
A web of concepts
Graph sketches: sparsification, spanners, and subgraphs
Finite Queries do not Have Effective Syntax
Approximation algorithms for clustering uncertain data
A Calculus for Complex Objects
Improvements on the k-center Problem for Uncertain Data
The fine classification of conjunctive queries and parameterized logarithmic space complexity
A divide-and-merge methodology for clustering
Learning and verifying quantified boolean queries by example
Schema mappings, data exchange, and metadata management
Incomplete data: what went wrong, and how to fix it
Rewrite rules for search database systems
Running tree automata on probabilistic XML
Conjunctive Selection Conditions in Main Memory
Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, March 21-23, 1983, Colony Square Hotel, Atlanta, Georgia, USA
Constraint Satisfaction and Database Theory: a Tutorial
Datalog redux: experience and conjecture
Applications of Sketching and Pathways to Impact
The recovery of a schema mapping: bringing exchanged data back
A dichotomy in the complexity of deletion propagation with functional dependencies
An Operational Approach to Data Bases
Efficient evaluation for a temporal logic on changing XML documents
Peer data exchange
Relative Error Streaming Quantiles
Determining relevance of accesses at runtime
Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding
DTD Inference for Views of XML Data
Statistical Estimators for Relational Algebra Expressions
Space efficient mining of multigraph streams
Embedded Join Dependencies as a Tool for Decomposing Full Join Dependencies
A dynamic I/O-efficient structure for one-dimensional top-k range reporting
Enumeration of first-order queries on classes of structures with bounded expansion
Foundations for Multifile Design by Application Partitioning
Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation
Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives
Incomplete information and certain answers in general data models
On the Power of Walking for Querying Tree-Structured Data
Is min-wise hashing optimal for summarizing set intersection?
Designing a Query Language for RDF: Marrying Open and Closed Worlds
A New Approach to Database Logic
A Fault-Tolerant Commit Protocol for Replicated Databases
Complexity of Query Processing in Databases with OR-Objects
Constraints among Argument Sizes in Logic Programs
When data dependencies over SQL tables meet the logics of paradox and S-3
Answering Recursive Queries Using Views
Distributed Algorithms for Dynamic Replication of Data
The Parallel Complexity of Simple Chain Queries
Untyped Sets, Invention, and Computable Queries
On the Integrity of Databases with Incomplete Information
A condensed representation to find frequent patterns
Annotated XML: queries and provenance
The Gibbs-Rand Model
Window Query-Optimal Clustering of Spatial Objects
Private Incremental Regression
Containment of Shape Expression Schemas for RDF
Extremal Fitting Problems for Conjunctive Queries
Cleaning inconsistencies in information extraction via prioritized repairs
Efficient Evaluation for a Subset of Recursive Queries
Decidable XPath Fragments in the Real World
Worst-case efficient range search indexing: invited tutorial
On the Relative Cost of Sampling for Join Selectivity Estimation
Computational Properties of Metaquerying Problems
FAQ: Questions Asked Frequently
Data exchange: getting to the core
The power of the dinur-nissim algorithm: breaking privacy of statistical and graph databases
On the BDD/FC conjecture
A Sound and Complete Query Evaluation Algorithm for Relational Databases with Disjunctive Information
What is "next" in event processing?
Privacy via pseudorandom sketches
Modeling Hot Spots In Database Systems
Constant Time Maintenance or The Triumph of the fd
A Model for the Prediction of R-tree Performance
Blockchains: Past, Present, and Future
Modular Architectures for Distributed and Database Systems
Tuple-Independent Representations of Infinite Probabilistic Databases
Views and queries: determinacy and rewriting
Why Not Negation by Fixpoint?
Context-sensitive program analysis as database queries
Why a Single Parallelization Strategy in not Enough in Knowledge Bases
Simulatable auditing
Determining source contribution in integration systems
XML type checking with macro tree transducers
Towards Estimation Error Guarantees for Distinct Values
Optimal Histograms for Hierarchical Range Queries
Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration
On the Semantics of Theory Change: Arbitration between Old and New Information
E-services: a look behind the curtain
Flexible Time Management in Data Stream Systems
Three-Valued Formalization of Logic Programming: Is It Needed?
Assumptions in Relational Database Theory
Tight Bounds for 2-Dimensional Indexing Schemes
A New Basis for the Weak Instance Model
Independent Database Schemas
Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
A Transportable Natural Language Database Update System
Mining Optimized Association Rules for Numeric Attributes
Multi-valued Dependencies in the Presence of Lists
Expressive and Efficient Pattern Languages for Tree-Structured Data
Approximate Counts and Quantiles over Sliding Windows
Rearranging Data to Maximize the Efficiency of Compression
On the Recognition and Design of Acyclic Databases
On Moving Object Queries
Stable Models and Non-Determinism in Logic Programs with Negation
Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms
Tutorial: Languages for Collection Types
Computing Covers for Embedded Functional Dependencies
Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, April 2-4, 1984, Waterloo, Ontario, Canada
2020 ACM PODS Alberto O. Mendelzon Test-of-Time Award
Locks with Constrained Sharing
GYO Reductions, Canonical Connections, Tree and Cyclic Schemas and Tree Projections
Declustering Using Error Correcting Codes
On the Containment and Equivalence of Database Queries with Linear Constraints
Asking the right questions: model-driven optimization using probes
Max-Sum diversification, monotone submodular functions and dynamic updates
Queries with Incomplete Answers over Semistructured Data
Concurrent Operations on B-Trees with Overtaking
Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration
Frequent Elements with Witnesses in Data Streams
Graph-Theoretic Methods in Database Theory
On the I/O Complexity of the k-Nearest Neighbors Problem
Inductive Pebble Games and the Expressive Power of Datalog
First-Order Query Evaluation with Cardinality Conditions
Querying Big Data by Accessing Small Data
Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries
Tracking Join and Self-Join Sizes in Limited Storage
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2020, Portland, OR, USA, June 14-19, 2020
Algebras for Querying Text Regions
The (Almost) Complete Guide to Tree Pattern Containment
Spanner Evaluation over SLP-Compressed Documents
Querying Aggregate Data
Efficient Sequencing Tape-Resident Jobs
GPC: A Pattern Calculus for Property Graphs