COMPUTING ICEBERG QUERIES HAVING NON ANTI MONOTONE CONSTRAINS WITH BIT MAP NUMBER

Computing aggregation values of user interesting attributes are important in decision and knowledge discovering systems. In real world, the users are interested only view to the aggregation values which meet some constrain this type of queries are call iceberg queries. The authors can optimize memor...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of Theoretical and Applied Information Technology 2016-02, Vol.84 (2), p.283-283
Hauptverfasser: Ravi, Pallam, Haritha, D, Polala, Niranjan
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Computing aggregation values of user interesting attributes are important in decision and knowledge discovering systems. In real world, the users are interested only view to the aggregation values which meet some constrain this type of queries are call iceberg queries. The authors can optimize memory requirement and CPU time for computing iceberg Queries having anti monotone constrains by eliminating non target set, but for Non anti monotone constrains they cannot eliminate non target sets, so it requires huge memory for answering the query, they propose a algorithm which produce target results using minimum memory and CPU time for computation by bit map numbers, explain with a sample iceberg query.
ISSN:1817-3195