Advanced Database Systems and Queries
External reference: https://openalex.org/T10317
-
gRPC was fastest for large read operations in comparison test Comparative performance analysis of GraphQL, gRPC, and Thrift for web interfaces shows gRPC fastest for large reads; GraphQL and Thrift better for small data volumes.
-
Replay-as-a-Service reduces tail latency in storage-disaggregated databases Study presents Replay-as-a-Service technique to reduce tail latency in storage-disaggregated OLTP databases by decoupling log replay from storage engine, achieving 40% latency reduction.
-
Understanding Query Optimization Bugs in Graph Database Systems Systematic study of query optimization bugs in graph databases reveals root causes, manifestation patterns, and fixes to improve GDBMS reliability and system design.
-
Temporal-clique query processing is made more efficient Temporal-clique subgraph pattern matching via integrated topological and temporal selectivity optimization with specialized join operators and cardinality estimation.
-
Delta Lake performance depends on careful optimization Evaluation of Delta Lake architecture, transaction models, and optimization techniques for analytic workload performance and data reliability at scale.
-
Logarithmic-time pattern matching for compressed and dynamic texts Study introduces O(log n)-time algorithms for Internal Pattern Matching queries on compressed and dynamic strings using recompression-based representations.

