Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Automated category tree construction: hardness bounds and algorithms: Label: en
The ring: worst-case optimal joins in graph databases using (almost) no extra space: Label: en
Database repairing with soft functional dependencies: Label: en
Sharing queries with nonequivalent user-defined aggregate functions: Label: en
Linking entities across relations and graphs: Label: en
Fast parallel hypertree decompositions in logarithmic recursion depth: Label: en
Partial order multiway search: Label: en
Model counting meets \(F_0\) estimation: Label: en
What's hot and what's not: tracking most frequent items dynamically: Label: en
Use of graph-theoretic models for optimal relational database accesses to perform join: Label: en
Database partitioning in a cluster of processors: Label: en
Limitations of concurrency in transaction processing: Label: en
Distributed Joins and Data Placement for Minimal Network Traffic: Label: en
Dynamic Complexity under Definable Changes: Label: en
K-Regret Queries Using Multiplicative Utility Functions: Label: en
Answering FO+MOD Queries under Updates on Bounded Degree Databases: Label: en
Bounded Query Rewriting Using Views: Label: en
TriAL: Label: en
Practical Private Range Search in Depth: Label: en
PrivBayes: Label: en
Linear Time Membership in a Class of Regular Expressions with Counting, Interleaving, and Unordered Concatenation: Label: en
Efficient SimRank-Based Similarity Join: Label: en
On the Hardness and Approximation of Euclidean DBSCAN: Label: en
An Indexing Framework for Queries on Probabilistic Graphs: Label: en
Approximation Algorithms for Schema-Mapping Discovery from Data Examples: Label: en
Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints: Label: en
Fast and Accurate Time-Series Clustering: Label: en
Response to “Differential Dependencies Revisited”: Label: en
Exact Model Counting of Query Expressions: Label: en
Exact and Approximate Maximum Inner Product Search with LEMP: Label: en
Guarded-Based Disjunctive Tuple-Generating Dependencies: Label: en
Extending the Kernel of a Relational DBMS with Comprehensive Support for Sequenced Temporal Queries: Label: en
Skycube Materialization Using the Topmost Skyline or Functional Dependencies: Label: en
Joins via Geometric Resolutions: Label: en
Monadic Datalog and Regular Tree Pattern Queries: Label: en
B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys: Label: en
Bounded Repairability for Regular Tree Languages: Label: en
A Declarative Framework for Linking Entities: Label: en
Scalable Atomic Visibility with RAMP Transactions: Label: en
The Complexity of Learning Tree Patterns from Example Graphs: Label: en
The Exact Complexity of the First-Order Logic Definability Problem: Label: en
Random Walk with Restart on Large Graphs Using Block Elimination: Label: en
Plan Bouquets: Label: en
Capturing Missing Tuples and Missing Values: Label: en
Synchronization of Queries and Views Upon Schema Evolutions: Label: en
Declarative Cleaning of Inconsistencies in Information Extraction: Label: en
Dichotomies for Queries with Negation in Probabilistic Databases: Label: en
SQL’s Three-Valued Logic and Certain Answers: Label: en
Negative Factor: Label: en
Learning Join Queries from User Examples: Label: en