Добро пожаловать в клуб

Показать / Спрятать  Домой  Новости Статьи Файлы Форум Web ссылки F.A.Q. Логобург    Показать / Спрятать

       
Поиск   
Главное меню
ДомойНовостиСтатьиПостановка звуковФайлыКнижный мирФорумСловарьРассылкаКаталог ссылокРейтинг пользователейЧаВо(FAQ)КонкурсWeb магазинКарта сайта

Поздравляем!
Поздравляем нового Логобуржца Светлана79 со вступлением в клуб!

Реклама

КНИЖНЫЙ МИР

Hierarchical clustering and bitmap indexes   S. M. Khalid Jamal and Raheel Khan

Hierarchical clustering and bitmap indexes

116 страниц. 2012 год.
LAP Lambert Academic Publishing
Decision support systems (DSS) works in read-mostly environment, which are subjugated by composite ad hoc queries that tend to, have high found sets. Normally Bitmap indexing is used to process complex queries in DSS. A bitmap file for indexed attribute comprises of one vector of bitmap or bits-strings per attribute value, with cardinality of the indexed relation is equal to the size of each bitmap. Bitmap indexing commonly used in data warehousing, OLAP and scientific applications for indexing of high dimensional data, all these applications, may have either complex or multi-dimensional ad-hoc queries for data of type read only. Bitmap indices are also very competent for Boolean logic at the bit level to evaluate query based on predicates and hence increased system response. Aggregate function such as COUNT, AVG (average) and SUM queries, whose results do not depend on the table while bitmap indexes are used, improve system performance as in case of OLAP application mostly queries...
 
- Генерация страницы: 0.04 секунд -