yusuke1997/dblp-id-title huggingface dataset:
External Hashing with Limited Internal Storage
Certain answers for XML queries
What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another?
From statistical knowledge bases to degrees of belief: an overview
Beyond worst-case analysis for joins with minesweeper
Analysis and Application of Adaptive Sampling
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016, San Francisco, CA, USA, June 26 - July 01, 2016
An Experimental Evaluation of Crash Recovery Mechanisms
Privacy, accuracy, and consistency too: a holistic solution to contingency table release
Adaptive Sampling for Geometric Problems over Data Streams
On the complexity of division and set joins in the relational algebra
Randomized computations on large data sets: tight lower bounds
The complexity of text-preserving XML transformations
Applying an Update Method to a Set of Receivers
Entity Matching with Active Monotone Classification
Non-Deterministic Queue Operations
Horn Clauses and the Fixpoint Query Hierarchy
One Flavor Assumption and Gamma-Acyclicity for Universal Relation Views
Roads, Codes and Spatiotemporal Queries
One-Sided Recursions
Mergeable summaries
Counting triangles in data streams
Optimizing linear counting queries under differential privacy
Semi-determinism
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Houston, TX, USA, June 10-15, 2018
Query-based data pricing
Any Algorithm in the Complex Object Algebra with Powerset Needs Exponential Space to Compute Transitive Closure
On the Representation of Infinite Temporal Data and Queries
Foundations of Semantic Web Databases
Towards a Sound View Integration Methodology
On the Complexity of Generating Optimal Plans with Cross Products
Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem
Nearest-neighbor searching under uncertainty
Reflective Programming in the Relational Algebra
Stable Model Semantics for Tuple-Generating Dependencies Revisited
Containment and equivalence of well-designed SPARQL
Concurrency Control in a Dynamic Search Structure
The Space-Efficient Core of Vadalog
Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 1-3, 1998, Seattle, Washington, USA
Machine models and lower bounds for query processing
Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model
Robust Set Reconciliation via Locality Sensitive Hashing
Replication and Consistency: Being Lazy Helps Sometimes
Reasoning about XML update constraints
Transforming Cyclic Schemas into Trees
Probabilistic Query Evaluation: The Combined FPRAS Landscape
Temporal Deductive Databases and Infinite Objects
Some Classes of Multilevel Relational Structures
Query Automata
When is the Evaluation of Extended CRPQ Tractable?
Positive higher-order queries
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration
On the Complexity of Commit Protocols
Efficient Aggregation over Objects with Extent
Better Algorithms for Counting Triangles in Data Streams
Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins
Set Similarity Search for Skewed Data
Circuit Treewidth, Sentential Decision, and Query Compilation
How the Degeneracy Helps for Triangle Counting in Graph Streams
Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension
JSON: Data model, Query languages and Schema specification
Semantically-based Concurrency Control for Search Structures
Using Write-once Memory for Database Storage
On scale independence for querying big data
Exceeding expectations and clustering uncertain data
Privacy-enhancing k -anonymization of customer data
Constraint-Based Query Optimization for Spatial Databases
XPath evaluation in linear time
Optimal Aggregation Algorithms for Middleware
Monotonic Aggregation in Deductive Databases
Constraint Checking with Partial Information
Evaluating rank joins with optimal cost
XML schema mappings
Data exchange and schema mappings in open and closed worlds
Complexity Bounds for Relational Algebra over Document Spanners
Approximate computation and implicit regularization for very large-scale data analysis
Path Caching: A Technique for Optimal External Searching
Static analysis of active XML systems
Algorithmic Fairness: Measures, Methods and Representations
XPath satisfiability in the presence of DTDs
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2011, June 12-16, 2011, Athens, Greece
On XML Integrity Constraints in the Presence of DTDs
A Fine-Grained Approach to Algorithms and Complexity
An adaptive packed-memory array
A Polymorphic Calculus for Views and Object Sharing
On the expressive power of update primitives
Flag & check: data access with monadically defined queries
Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 13-15, 2005, Baltimore, Maryland, USA
Transaction Commitment at Minimal Communication Cost
Indexing uncertain data
Inverting Relational Expressions - A Uniform and Natural Technique for Various Database Problems
Positivism vs. Minimalism in Deductive Databases
An Extended Relational Algebra with Control over Duplicate Elimination
A Class of Data Structures for Associative Searching
SQL Nulls and Two-Valued Logic
A Nearly Instance-optimal Differentially Private Mechanism for Conjunctive Queries
An Operational Model for Database System Reliability
Quasi-inverses of schema mappings
An Alternating Fixpoint Tailored to Magic Programs
A Relational Framework for Classifier Engineering
How to Evaluate Multiple Range-Sum Queries Progressively
Efficient Enumeration for Annotated Grammars
An Algorithm for Minimizing Roll Back Cost
Database Relations with Null Values
Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis
Reasoning about Nested Functional Dependencies
Efficiently Enumerating Answers to Ontology-Mediated Queries
Reflections on Schema Mappings, Data Exchange, and Metadata Management
LOG Write-Ahead Protocols and IMS/VS Logging
Algorithmic Techniques for Independent Query Sampling
Data mining, Hypergraph Transversals, and Machine Learning
All-Instances Restricted Chase Termination
Complexity of Answering Queries Using Materialized Views
Differential Privacy and the US Census
On the decidability and finite controllability of query processing in databases with incomplete information
Mixed-Approach Algorithms for Transitive Closure
On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs
Distinct Sampling on Streaming Data with Near-Duplicates
The complexity of data exchange
Monadic Datalog and the Expressive Power of Languages for Web Information Extraction
Query Containment for Conjunctive Queries with Regular Expressions
A Call to Order
Tie-Breaking Semantics and Structural Totality
Correctness and Parallelism of Composite Systems
On the Implementation of a Simple Class of Logic Queries for Databases
Deterministic regular expressions in linear time
Towards Theory for Real-World Data
Algorithmic Aspects of Multiversion Concurrency Control
Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors
On finding skylines in external memory
On the complexity of privacy-preserving complex event processing
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2019, Amsterdam, The Netherlands, June 30 - July 5, 2019
Logic Programming as Constructivism: A Formalization and its Application to Databases
Increasing Availability in Partitioned Database Systems
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS'14, Snowbird, UT, USA, June 22-27, 2014
Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems
Optimal Algorithms for Multiway Search on Partial Orders
word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Data
Composition of mappings given by embedded dependencies
Lossless Regular Views
Learning Efficient Query Processing Strategies
On the Properties and Characterization of Connection-tap-free Schemes
Reducing Recovery Constraints on Locking based Protocols
LogiQL: A Declarative Language for Enterprise Applications
Write-Optimized Skip Lists
Hypertree Decompositions: Questions and Answers
Modular Stratification and Magic Sets for DATALOG Programs with Negation
A quest for beauty and wealth (or, business processes for database researchers)
Tractable Query Languages for Complex Object Databases
Languages for Relational Databases over Interpreted Structures
Lower bounds for sorting with few random accesses to external memory
An efficient rigorous approach for identifying statistically significant frequent itemsets
Generalizing Data to Provide Anonymity when Disclosing Information (Abstract)
Statistical Relational Learning: Unifying AI & DB Perspectives on Structured Probabilistic Models
Closing the Gap between Theory and Practice in Query Optimization
Dynamically Distributed Query Evaluation
Evolution of page popularity under random web graph models
Generating low-cost plans from proofs
Independent and Separable Database Schemes
The Queue Protocol: A Deadlock-free Homogeneous Non-Two-Phase Locking Protocol
Reasoning about Strings in Databases
Space-efficient estimation of statistics over sub-sampled streams
Optimal Score Aggregation Algorithms
Provenance views for module privacy
A Normal Form for XML Documents
Optimal sampling from distributed streams
On the complexity of managing probabilistic XML data
Detecting Redundant Tuples During Query Evaluation
Connections in Acyclic Hypergraphs
On the Complexity of Bounded-Variable Queries
Simplifying XML schema: single-type approximations of regular tree languages
Minimal Data Upgrading to Prevent Inference and Association
Near-optimal dynamic replication in unstructured peer-to-peer networks
Magic-sets Transformation in Nonrecursive Systems
Sequences, Datalog and Transducers
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China
The Impact of Recovery on Concurrency Control
Fractals for Secondary Key Retrieval
Relaxing the Universal Relation Scheme Assumption
Small Armstrong Relations for Database Design
Indexing for Keyword Search with Structured Constraints
Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 21-23, 2001, Santa Barbara, California, USA
A Simple Analytic Model for Performance of Exclusive Locking in Database Systems
Conjunctive Regular Path Queries under Injective Semantics
Making Consistency Protocols Serializable
A Characterization of First-Order Topological Properties of Planar Spatial Data
An Axiomatic Approach to Deciding Query Safety in Deductive Databases
Communication steps for parallel query processing
Efficiently Enumerating Minimal Triangulations
The power of tree projections: local consistency, greedy algorithms, and larger islands of tractability
Relationship privacy: output perturbation for queries with joins
Strict Histories in Object-Based Database Systems
Termination Detection in Logic Programs using Argument Sizes
A Graph-Oriented Object Database Model
Database Repairs and Consistent Query Answering: Origins and Further Developments
Concurrency and Linear Hashing
Certain Answers Meet Zero-One Laws
The complexity of evaluating path expressions in SPARQL
Algorithms for data migration with cloning
Throughput-Competitive Admission Control for Continuous Media Databases
On the Decidability of Semi-Linearity of Semi-Algebraic Sets and Its Implications for Spatial Databases
Decidability and Undecidability Results for Boundedness of Linear Recursive Queries
Semantic Representations and Query Languages for Or-sets
Inference Rules for Functional and Inclusion Dependencies
Space-optimal heavy hitters with strong error bounds
Expressive Power and Data Complexity of Query Languages for Trees and Lists
Theory of Serializability for a Parallel Model of Transactions
Practical privacy: the SuLQ framework
OLAP Dimension Constraints
FTW: fast similarity search under the time warping distance
Verification of Hierarchical Artifact Systems
Safe Constraint Queries
Tight Fine-Grained Bounds for Direct Access on Join Queries
Optimal Termination Prococols for Network Partitioning
Distributed Management in Local Area Networks
An Approximation Algorithm to the File Allocation Problem in Computer Networks
Pattern Matching by Rs-Operations: Toward a Unified Approach to Querying Sequenced Data
A Model-Theoretic Approach to Updating Logical Databases
Deadlock-Freedom (and Safety) of Transactions in a Distributed Database
Default Negation for Non-Guarded Existential Rules
A Universal Relation Database System Implemented via the Network Model
On the Decidability of Containment of Recursive Datalog Queries - Preliminary report
Fast Algorithms For Hierarchical Range Histogram Construction
Query Evaluation by Circuits
On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates
Proceedings of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 2-4, 1992, San Diego, California, USA
Combinatorial Games In Database Theory
Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation
Tutorial Database Mining
Space complexity of hierarchical heavy hitters in multi-dimensional data streams
The logic of RDF and SPARQL: a tutorial
Similarity caching
Attacking Diophantus: Solving a Special Case of Bag Containment
Operator placement for in-network stream query processing
Least Expected Cost Query Optimization: What Can We Expect?
Serialization Graph Algorithms for Multiversion Concurrency Control
Non-linear prefixes in query languages
Sets and Negation in a Logic Database Language (LDL1)
Clustering via Matrix Powering
The Adversarial Robustness of Sampling
Type Inference for Queries on Semistructured Data
Algorithms for a Topology-aware Massively Parallel Computation Model
On the complexity of nonrecursive XQuery and functional query languages on complex values
Towards a Theory of Online Schedulers
Performance guarantees for B-trees with different-sized atomic keys
Remarks on the Algebra of Non First Normal Form Relations
Replicated Declustering of Spatial Data
The complexity of query containment in expressive fragments of XPath 2.0
A Tight Upper Bound on the Benefits of Replication and Consistency Control Protocols
The Expressiveness of a Family of Finite Set Languages
Computing query probability with incidence algebras
Models and methods for privacy-preserving data publishing and analysis: invited tutorial
CWA-solutions for data exchange settings with target dependencies
Combining Fuzzy Information from Multiple Systems
Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size
The view selection problem for XML content based routing
Fixed-Point Query Languages for Linear Constraint Databases
Frontiers of Tractability for Typechecking Simple XML Transformations
Logical Design of Relational Database Systems
On Genericity and Parametricity
Relative Knowledge in a Distributed Database
Expressibility of Bounded-Arity Fixed-Point Query Hierarchies
Histograms revisited: when are histograms the best approximation method for aggregates over joins?
On the Complexity of Join Predicates
Approximately Counting Subgraphs in Data Streams
Clustered Multiattribute Hash Files
Inclusion Dependencies and the Universal Instance
Equivalence of nested queries with mixed semantics
Local-vs-Global Consistency of Annotated Relations
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth
Similarity-Based Queries
Modeling Complex Structures in Object-Oriented Databases
Indexing for Data Models with Constraints and Classes
On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases
Distributed Consistency Beyond Queries
Negation and Minimality in Non-Horn Databases
Dynamic Assembly of Views in Data Cubes
On the Equivalence of Recursive and Nonrecursive Datalog Programs
On Tree-Based Techniques for Query Evaluation
The complexity of mining maximal frequent subgraphs
Relative risk and odds ratio: a data mining perspective
An incremental algorithm for computing ranked full disjunctions
On Concurrency Control by Multiple Versions
Deciding Boundedness of Monadic Sirups
Projection Views of Register Automata
Dichotomies in the Complexity of Preferred Repairs
Finding global icebergs over distributed data sets
The input/output complexity of triangle enumeration
The ACM PODS Alberto O. Mendelzon test-of-time award 2012
Approximating and testing k-histogram distributions in sub-linear time
The Format Model: A Theory of Database Organization
Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 12-14, 1997, Tucson, Arizona, USA
Generalized schema-mappings: from termination to tractability
Proof-Tree Transformation Theorems and Their Applications
Triangle and Four Cycle Counting in the Data Stream Model
Efficient Indexes for Diverse Top-k Range Queries
Specification and Verification of Abstract Database Types
Tractable database design through bounded treewidth
Typed Query Languages for Databases Containing Queries
Answering aggregate queries in data exchange
Querying graph databases
The Equivalence of Solving Queries and Production Tree Projections
Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2009, June 19 - July 1, 2009, Providence, Rhode Island, USA
On the complexity of deriving schema mappings from database instances
Consensus answers for queries over probabilistic databases
Universal Private Estimators
Expressive languages for path queries over graph-structured data
Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms
Data Path Queries over Embedded Graph Databases
Deciding well-definedness of XQuery fragments
On Functional Aggregate Queries with Additive Inequalities
Skew in parallel query processing
Epistemic privacy
On the Correctness of a Local Storage Subsystem
Data exchange beyond complete data
A Cost Model for Similarity Queries in Metric Spaces
On Herbrand Semantics and Conflict Serializability of Read-Write Transactions
Get the most out of your sample: optimal unbiased estimators using partial information
Towards an axiomatization of statistical privacy and utility
Synthesizing Nested Relational Queries from Implicit Specifications
On Asymptotic Cost of Triangle Listing in Random Graphs
Applications of Linear Algebra in Information Retrieval and Hypertext Analysis
The View-Selection Problem Has an Exponential-Time Lower Bound for Conjunctive Queries and Views
Updating Databases in the Weak Instance Model
The expressivity of XPath with transitive closure
Reverse Engineering SPJ-Queries from Examples
A Logic for Object-Oriented Logic Programming (Maier's O-Logic Revisited)
Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins
A Semantics for Complex Objects and Approximate Queries
The Well-Founded Semantics of Aggregation
Information complexity: a tutorial
Making SQL Queries Correct on Incomplete Databases: A Feasibility Study
Constraint Programming and Database Languages: A Tutorial
Verification of database-driven systems via amalgamation
Equivalence of SQL queries in presence of embedded dependencies
Structural Totality and Constraint Stratification
Parallel evaluation of conjunctive queries
Maximally joining probabilistic data
In-memory Representations of Databases via Succinct Data Structures: Tutorial Abstract
Categorical range maxima queries
Open Problems in Electronic Commerce
On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies
Finding and approximating top-k answers in keyword proximity search
Aggregate Queries on Sparse Databases
Maintaining bernoulli samples over evolving multisets
Trees, Automata and XML
Conceptual-To-Internal Mappings in Commercial Database Systems
Practical Algorithms for Finding Prime Attributes and Testing Normal Forms
Probabilistic Databases for All
Allocating isolation levels to transactions
The Alternating Fixpoint of Logic Programs with Negation
Generalized hypertree decompositions: np-hardness and tractable variants
Future Directions and Research Problems in the World Wide Web (Abstract)
On Being Optimistic about Real-Time Constraints
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, USA
Expressiveness and complexity of xml publishing transducers
Bounded Arity Datalog (!=) Queries on Graphs
How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)?
Bag Query Containment and Information Theory
Optimal Bounds for Approximate Counting
Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform
The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2023
Verification of communicating data-driven web services
Notions of Dependency Satisfaction
Information Theoretic Aspects of Data Bases
Approximate quantiles and the order of the stream
Document Spanners - A Brief Overview of Concepts, Results, and Recent Developments
Scalable computation of acyclic joins
Distributed Computation of Web Queries Using Automata
Method Schemas
The Temporal Query Language TQuel
Topology Dependent Bounds For FAQs
A Framework for Measuring Changes in Data Characteristics
Limiting privacy breaches in privacy preserving data mining
Optimal Uncoordinated Unique IDs
Is Byzantine Agreement Useful in a Distributed Database?
Perspectives in Deductive Databases (Abstract)
A Transcation Language Complete for Database Update and Specification
Robustness Against Read Committed: A Free Transactional Lunch
Querying semantic web data with SPARQL
Optimization of Sequence Queries in Database Systems
Stable Set and Multiset Operations in Optimal Time and Space
Recency-Bounded Verification of Dynamic Database-Driven Systems
Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 22-25, 1995, San Jose, California, USA
Normal Forms and Conservative Properties for Query Languages over Collection Types
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2008, June 9-11, 2008, Vancouver, BC, Canada
The Complexity of Reliable Concurrency Control
Optimizing Datalog Programs
On the Optimality of Disk Allocation for Cartesian Product Files
Rewriting of Rules Containing Set Terms in a Logic Data Model (LDL)
Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms
On the First-Order Expressibility of Recursive Queries
Querying Probabilistic Preferences in Databases
On the Complexity of the View-Selection Problem
Normalizing Incomplete Databases
Locating a Small Cluster Privately
Beyond simple aggregates: indexing for summary queries
Probabilistic Databases with an Infinite Open-World Assumption
Privacy: From Database Reconstruction to Legal Theorems
Analytical Modeling of Materialized View Maintenance
Parallel Evaluation of Recursive Rule Queries
When Can We Answer Queries Using Result-Bounded Data Interfaces?
On probabilistic fixpoint and Markov chain query languages
Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search
Updating a Relational Database through a Universal Schema Interface
Formal Models of Web Queries
Structural characterizations of the semantics of XPath as navigation tool on a document
A Tight Lower Bound for Comparison-Based Quantile Summaries
Cache-oblivious hashing
Optimization of continuous queries with shared expensive filters
Labeling Dynamic XML Trees
A Novel Checkpointing Scheme for Distributed Database Systems
Safe Locking Policies for Dynamic Databases
k-Means Projective Clustering
Characterizing Memory Requirements for Queries over Continuous Data Streams
Verification of Relational Transducers for Electronic Commerce
On the Expressive Power of the Extended Relational Algebra for the Unnormalized Relational Model