yusuke1997/dblp-id-title huggingface dataset:
Research Directions in Object-Oriented Database Systems
Datalog Expressiveness of Chain Queries: Grammar Tools and Characterizations
The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems
Decidability and Expressiveness of Logic Queries
Processing Queries By Linear Constraints
A general datalog-based framework for tractable query answering over ontologies
String Operations in Query Languages
Answering Queries Using Templates with Binding Patterns
Coping with Incomplete Data: Recent Advances
A Dichotomy in Consistent Query Answering for Primary Keys and Unary Foreign Keys
Soft stratification for magic set based query evaluation in deductive databases
The containment problem for REAL conjunctive queries with inequalities
Independent range sampling
Completeness Results for Recursive Data Bases
Distributed Statistical Estimation of Matrix Products with Applications
Safety of Datalog Queries over Infinite Databases
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
A dichotomy for non-repeating queries with negation in probabilistic databases
On the Recognition of Coverings of Acyclic Database Hypergraphs
Querying Constraints
Elimination of Intersection Anomalies from Database Schemes
Non-Uniformly Terminating Chase: Size and Complexity
On the Equivalence of Database Restructurings Involving Object Identifiers
Deleting Completed Transactions
The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints
Randomized algorithms for tracking distributed count, frequencies, and ranks
From Discrepancy to Declustering: Near optimal multidimensional declustering strategies for range queries
A dichotomy in the intensional expressive power of nested relational calculi augmented with aggregate functions and a powerset operator
Can Datalog be Approximated?
XPath evaluation in linear time with polynomial combined complexity
Context-Based Synchronisation: An Approach beyond Semantics for Concurrency Control
On the Feasibility of Checking Temporal Integrity Constraints
How Fast can a Distributed Transaction Commit?
XML with incomplete information: models, properties, and query answering
On Computing Functions with Uncertainty
On Views and XML
Well-founded semantics for extended datalog and ontological reasoning
Processing queries on tree-structured data efficiently
Equivalence of queries combining set and bag-set semantics
All-distances sketches, revisited: HIP estimators for massive graphs analysis
Efficiently ordering subgoals with access constraints
Logical Aspects of Massively Parallel and Distributed Systems
Latent Semantic Indexing: A Probabilistic Analysis
2017 ACM PODS Alberto O. Mendelzon Test-of-Time Award
Set Cover in the One-pass Edge-arrival Streaming Model
Shape sensitive geometric monitoring
Understanding cardinality estimation using entropy maximization
Sort Sets in the Relational Model
Dyn-FO: A Parallel, Dynamic Complexity Class
Safety and Correct Translation of Relational Calculus Formulas
On the Power of Alexander Templates
The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2015
On the Memory Requirements of XPath Evaluation over XML Streams
Spanners: a formal framework for information extraction
Two-dimensional Substring Indexing
Referential Actions as Logic Rules
A Decidable Class of Bounded Recursions
Database Updates in Logic Programming
Relative information completeness
On provenance minimization
Communication Cost in Parallel Query Evaluation: A Tutorial
Towards a Unified Theory of Concurrency Control and Recovery
Polynomial-Time Program Transformations in Deductive Databases
Processing and Optimization of Multiway Spatial Joins Using R-Trees
Satisfiability and relevance for queries over active documents
Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 25-28, 1993, Washington, DC, USA
Efficient Computation of Temporal Aggregates with Range Predicates
Parallel-Correctness and Transferability for Conjunctive Queries
2021 ACM PODS Alberto O. Mendelzon Test-of-Time Award
General and Fractional Hypertree Decompositions: Hard and Easy Cases
Utilization of B-trees with Inserts, Deletes and Modifies
The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs
Query Evaluation over SLP-Represented Document Databases with Complex Document Editing
Integrity Constraints for XML
Consistent Query Answers in Inconsistent Databases
What's hot and what's not: tracking most frequent items dynamically
Relative Information Capacity of Simple Relational Database Schemata
Synopses for Query Optimization: A Space-Complexity Perspective
Deciding Properties of Transactional Schemas
Modular Acyclicity and Tail Recursion in Logic Programs
Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, May 15-17, 2000, Dallas, Texas, USA
Expressiveness of guarded existential rule languages