Sep 2026· Theory of Computing Systems· Vol 70· 0 citations· 29 references
TL;DR
Results show that OnGP provides a robust online solution with efficiencies close to the Best Fit algorithm, while OffGP matches the near-optimal performance of Best Fit Decreasing within a 1.036% margin, confirming their value for time-critical applications.
Motivated by recent optimality results in matching models, we consider the symmetric W-matching model with three demand classes and two supply classes, and a threshold-based matching policy with finite threshold value T. Under this policy, class-2 demand items are matched to any supply item only when the number of supp...
Gontzal Sagastabeitia, E. Anton, J. Doncel· Queueing systems· 0 citations
The K Nearest Neighbors Query (KNNQ) is a fundamental distance-based query with applications in Geographic Information Systems (GIS) and many other domains. The K Nearest Neighbors Join Query (KNNJQ) combines KNNQ with the join operation to find the K nearest neighbors from a dataset P to every object in another datase...
Guillermo de Bernardo, Miguel R. Penabad, Antonio Corral et al.· GeoInformatica· 0 citations
Organizations processing historical datasets with billions of rows face a fundamental architectural choice: move data to computation (the traditional query-centric approach) or move computation to data. This paper presents the Computation-Proximate Pattern, an architecture that combines actor-based in-memory computatio...
A. Jaime· Distributed and parallel dat...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.