Efficient caching for constrained skyline queries

摘要: Constrained skyline queries retrieve all points that optimize some user’s preferences subject to orthogonal range constraints, but at significant computational cost. This paper is the first propose caching improve constrained query response time. Because arbitrary constraints are unlikely match a cached exactly, our proposed method identifies and exploits similar reduce overhead of subsequent ones. We consider interactive users posing string show how these can be classified into four cases based on they overlap queries. For each we present specialized solution. general case independent users, introduce Missing Points Region (MPR), minimizes disk reads, an approximation MPR. An extensive experimental evaluation reveals querying for (approximate) MPR drastically reduces both fetch times computation.