We propose monotonic consistent caching (MCC), a cache scheme for applications that demand transactional guarantees. MCC warrants that a transaction-like request always sees a consistent view of the backend database and that observed writes over the cache will not be lost, even if it operates on conventional cache syst...
Shuai An, Yang Cao, Jia Li et al.· ACM Transactions on Database...· 0 citations
Vector databases are increasingly central to retrieval applications, yet deployments remain embedding-siloed: different databases store vectors produced by different embedding models and ANN pipelines, making cross-database search ill-defined or forcing expensive re-embedding and index rebuilds. We propose
metric al...
Tian-Jian Yang, Yang Cao, Bei-Ning Yang et al.· Proceedings of the ACM on Ma...· 0 citations
Formal feature explanations strictly maintain perfect conformity but are intractable to compute, while heuristic methods are much faster but can lead to problematic explanations due to lack of conformity guarantees. We propose relative keys that have the best of both worlds. Relative keys associate feature explanations...
Shuai An, Yang Cao, Jia Li et al.· The VLDB journal· 1 citation
We propose monotonic consistent caching (MCC), a cache scheme for applications that demand transactional guarantees. MCC warrants that a transaction-like request always sees a consistent view of the backend database and that observed writes over the cache will not be lost, even if it operates on conventional cache syst...
Shuai An, Yang Cao, Jia Li et al.· ACM Transactions on Database...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
