Maintaining Queries under Updates Using Heavy-Light Partitioning of the Input Relations
Fuente:
arXiv
Guardado en:
| Autores principales: | Abo-Khamis, Mahmoud, Chmielewski, Eden, Draghici, Andrei, Kara, Ahmet, Olteanu, Dan |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Output-Sensitive Evaluation of Regular Path Queries
por: Khamis, Mahmoud Abo, et al.
Publicado: (2024)
por: Khamis, Mahmoud Abo, et al.
Publicado: (2024)
Insert-Only versus Insert-Delete in Dynamic Query Evaluation
por: Khamis, Mahmoud Abo, et al.
Publicado: (2023)
por: Khamis, Mahmoud Abo, et al.
Publicado: (2023)
Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries
por: Khamis, Mahmoud Abo, et al.
Publicado: (2025)
por: Khamis, Mahmoud Abo, et al.
Publicado: (2025)
Output-Sensitive Evaluation of Acyclic Conjunctive Regular Path Queries
por: Khamis, Mahmoud Abo, et al.
Publicado: (2025)
por: Khamis, Mahmoud Abo, et al.
Publicado: (2025)
Conjunctive Queries with Free Access Patterns under Updates
por: Kara, Ahmet, et al.
Publicado: (2022)
por: Kara, Ahmet, et al.
Publicado: (2022)
F-IVM: Analytics over Relational Databases under Updates
por: Kara, Ahmet, et al.
Publicado: (2023)
por: Kara, Ahmet, et al.
Publicado: (2023)
Join Size Bounds using Lp-Norms on Degree Sequences
por: Khamis, Mahmoud Abo, et al.
Publicado: (2023)
por: Khamis, Mahmoud Abo, et al.
Publicado: (2023)
Pessimistic Cardinality Estimation
por: Khamis, Mahmoud Abo, et al.
Publicado: (2024)
por: Khamis, Mahmoud Abo, et al.
Publicado: (2024)
LpBound: Pessimistic Cardinality Estimation using $\ell_p$-Norms of Degree Sequences
por: Zhang, Haozhe, et al.
Publicado: (2025)
por: Zhang, Haozhe, et al.
Publicado: (2025)
Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation
por: Khamis, Mahmoud Abo, et al.
Publicado: (2025)
por: Khamis, Mahmoud Abo, et al.
Publicado: (2025)
PANDA: Query Evaluation in Submodular Width
por: Khamis, Mahmoud Abo, et al.
Publicado: (2024)
por: Khamis, Mahmoud Abo, et al.
Publicado: (2024)
Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time
por: Khamis, Mahmoud Abo, et al.
Publicado: (2026)
por: Khamis, Mahmoud Abo, et al.
Publicado: (2026)
Tractable Conjunctive Queries over Static and Dynamic Relations
por: Kara, Ahmet, et al.
Publicado: (2024)
por: Kara, Ahmet, et al.
Publicado: (2024)
Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms
por: Abramovich, Omer, et al.
Publicado: (2025)
por: Abramovich, Omer, et al.
Publicado: (2025)
Query Optimization and Evaluation via Information Theory: A Tutorial
por: Khamis, Mahmoud Abo, et al.
Publicado: (2026)
por: Khamis, Mahmoud Abo, et al.
Publicado: (2026)
Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
por: Kara, Ahmet, et al.
Publicado: (2019)
por: Kara, Ahmet, et al.
Publicado: (2019)
A Unifying Algorithm for Hierarchical Queries
por: Khamis, Mahmoud Abo, et al.
Publicado: (2025)
por: Khamis, Mahmoud Abo, et al.
Publicado: (2025)
Fast Matrix Multiplication meets the Submodular Width
por: Abo-Khamis, Mahmoud, et al.
Publicado: (2024)
por: Abo-Khamis, Mahmoud, et al.
Publicado: (2024)
PANDAExpress: a Simpler and Faster PANDA Algorithm
por: Khamis, Mahmoud Abo, et al.
Publicado: (2025)
por: Khamis, Mahmoud Abo, et al.
Publicado: (2025)
Convergence of Datalog over (Pre-) Semirings
por: Khamis, Mahmoud Abo, et al.
Publicado: (2021)
por: Khamis, Mahmoud Abo, et al.
Publicado: (2021)
Recent Increments in Incremental View Maintenance
por: Olteanu, Dan
Publicado: (2024)
por: Olteanu, Dan
Publicado: (2024)
Using Process Calculus for Optimizing Data and Computation Sharing in Complex Stateful Parallel Computations
por: Tian, Zilu, et al.
Publicado: (2025)
por: Tian, Zilu, et al.
Publicado: (2025)
Towards Parameterized Hardness on Maintaining Conjunctive Queries
por: Wang, Qichen
Publicado: (2026)
por: Wang, Qichen
Publicado: (2026)
Indexing Join Inputs for Fast Queries and Maintenance
por: Lyu, Wenhui, et al.
Publicado: (2025)
por: Lyu, Wenhui, et al.
Publicado: (2025)
Range (Rényi) Entropy Queries and Partitioning
por: Esmailpour, Aryan, et al.
Publicado: (2023)
por: Esmailpour, Aryan, et al.
Publicado: (2023)
Partition Constraints for Conjunctive Queries: Bounds and Worst-Case Optimal Joins
por: Deeds, Kyle, et al.
Publicado: (2025)
por: Deeds, Kyle, et al.
Publicado: (2025)
CHORUS: Foundation Models for Unified Data Discovery and Exploration
por: Kayali, Moe, et al.
Publicado: (2023)
por: Kayali, Moe, et al.
Publicado: (2023)
QirK: Question Answering via Intermediate Representation on Knowledge Graphs
por: Scheerer, Jan Luca, et al.
Publicado: (2024)
por: Scheerer, Jan Luca, et al.
Publicado: (2024)
Querying Graph-Relational Data
por: Sullivan, Michael J., et al.
Publicado: (2025)
por: Sullivan, Michael J., et al.
Publicado: (2025)
Efficient Path Query Processing in Relational Database Systems
por: Correa, Diego Rivera, et al.
Publicado: (2026)
por: Correa, Diego Rivera, et al.
Publicado: (2026)
On the Expressiveness of Languages for Querying Property Graphs in Relational Databases
por: Rotschield, Hadar, et al.
Publicado: (2025)
por: Rotschield, Hadar, et al.
Publicado: (2025)
Relational to RDF Data Migration by Query Co-Evaluation
por: Wisnesky, Ryan, et al.
Publicado: (2024)
por: Wisnesky, Ryan, et al.
Publicado: (2024)
The Space-Time Complexity of Sum-Product Queries
por: Deeds, Kyle, et al.
Publicado: (2025)
por: Deeds, Kyle, et al.
Publicado: (2025)
Query Answering under Volume-Based Diversity Functions
por: Arenas, Marcelo, et al.
Publicado: (2025)
por: Arenas, Marcelo, et al.
Publicado: (2025)
Memelang: An Axial Grammar for LLM-Generated Vector-Relational Queries
por: Holt, Bri
Publicado: (2025)
por: Holt, Bri
Publicado: (2025)
Distributed Evaluation of Graph Queries using Recursive Relational Algebra
por: Chlyah, Sarah, et al.
Publicado: (2021)
por: Chlyah, Sarah, et al.
Publicado: (2021)
Can Large Language Models Be Query Optimizer for Relational Databases?
por: Tan, Jie, et al.
Publicado: (2025)
por: Tan, Jie, et al.
Publicado: (2025)
DGAI: Decoupled On-Disk Graph-Based ANN Index for Efficient Updates and Queries
por: Lou, Jiahao, et al.
Publicado: (2025)
por: Lou, Jiahao, et al.
Publicado: (2025)
Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree
por: Al-Mamun, Abdullah, et al.
Publicado: (2025)
por: Al-Mamun, Abdullah, et al.
Publicado: (2025)
LIRA: A Learning-based Query-aware Partition Framework for Large-scale ANN Search
por: Zeng, Ximu, et al.
Publicado: (2025)
por: Zeng, Ximu, et al.
Publicado: (2025)
Ejemplares similares
-
Output-Sensitive Evaluation of Regular Path Queries
por: Khamis, Mahmoud Abo, et al.
Publicado: (2024) -
Insert-Only versus Insert-Delete in Dynamic Query Evaluation
por: Khamis, Mahmoud Abo, et al.
Publicado: (2023) -
Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries
por: Khamis, Mahmoud Abo, et al.
Publicado: (2025) -
Output-Sensitive Evaluation of Acyclic Conjunctive Regular Path Queries
por: Khamis, Mahmoud Abo, et al.
Publicado: (2025) -
Conjunctive Queries with Free Access Patterns under Updates
por: Kara, Ahmet, et al.
Publicado: (2022)