Answering preference queries with bit-sliced index arithmetic
Denis Rinfret · 2008
Systems providing only exact match answers, without allowing any kind of preference or approximate queries, are not sufficient in many contexts. Many different approaches have been introduced, often incompatible in their setup or proposed implementation. This work shows how different kinds of preference queries (PREFER, preference SQL and skyline) can be combined and answered efficiently using bit-sliced index (BSI) arithmetic. This approach has been implemented in a DBMS and performance results are included, showing that the bit-sliced index approach is efficient not only in a prototype system, but in a real system.