Database federation is becoming an increased reality for business and clinical organizations due to rapid data accumulation, making a single, monolithic data warehouse difficult to achieve. A commonly used technique to decrease query execution time in data warehousing environments is to precompute and store beneficial views. Known as the view selection problem, this process seeks to identify th...

Feature selection is one of the most important preprocessing steps in data mining and knowledge Engineering. In this short review paper, apart from a brief taxonomy of current feature selection methods, we review feature selection methods that are being used in practice. Subsequently we produce a near comprehensive list of problems that have been solved using feature selection across technical ...

In a data warehousing environment, aggregate views are often materialized in order to speed up aggregate queries of online analytical processing (OLAP). Due to the increasing size of data warehouses, it is often infeasible to materialize all views. View selection, the task of selecting a subset of views to materialize based on updates and expectations of the query load, is an important and chal...

This is a draft of my contribution to a book chapter (doi: 10.4018/978-1-60566-816-1.ch005). We mainly categorize and review the existing approaches to materialized view selection. View selection addresses the problem of choosing materialized views in the design process of data warehouses. Informally, it can be stated as, given an estimated query workload and possibly also sets of candidate vie...

Consider XML content-based document routing: a stream of XML documents are routed through a network, and routing decisions are taken based on the result of evaluating XPath predicates on these documents. Parsing XML documents and interpreting XPath expressions is the main bottleneck in such systems. We propose a novel solution to speedup the evaluation of XPath predicates based on precomputing ...