1 citations · 1 across the 14 of their papers we have counts for
12 papers · 1 filter
The Decode-Work Law: Margin-Governed, Provably-Exact Spatial Joins over Compressed Geometry
Madhulatha Mandarapu, Sandeep Kunkunuru
Filter-and-refine spatial joins have always avoided touching exact geometry for certified candidate pairs, but the field never modeled the decompression cost of the pairs that surv…
When to Repair a Graph ANN Index: A Matched-Budget Negative Result, and the Interpolated-Baseline Trap That Hid It
Madhulatha Mandarapu, Sandeep Kunkunuru
Graph approximate-nearest-neighbor (ANN) indexes (HNSW, DiskANN/Vamana) lose recall under insert/delete churn, because deletions orphan the greedy-search paths that route through r…
Knowledge Graphs as the Missing Data Layer for LLM-Based Industrial Asset Operations
Madhulatha Mandarapu, Sandeep Kunkunuru
LLM-based agents for industrial asset operations show limited accuracy when reasoning over flat document stores. AssetOpsBench (KDD 2026) establishes that GPT-4 agents achieve 65%…
One Index for Subsumption and Roll-up across Time, Geography, and Ontology
Madhulatha Mandarapu, Sandeep Kunkunuru
Time-series, geospatial, and ontology systems each maintain a hierarchy -- day <= month <= year, zip <= city, is-a / part-of -- and each indexes it in a separate silo. We observe t…
When Is a Columnar Scan Bandwidth-Bound? A Decode-Throughput Law and Its Cross-Hardware Validation
Madhulatha Mandarapu, Sandeep Kunkunuru
A columnar scan that decompresses, filters, and aggregates should be limited only by memory bandwidth (the roofline floor T >= BytesRead/beta), yet real kernels are often compute-b…
Caching for Dollars, Not Hits: An Exact Offline Reference for Cloud-Egress Caching and the Crossover That Decides When It Pays
Madhulatha Mandarapu, Sandeep Kunkunuru
When a cache miss fetches from cloud object storage, the bill is per GET request and per byte of egress, not latency. Classic caching minimizes the miss rate, the wrong objective:…