Searching for authors named "Henrique Andrade" – sorted by Relevance.
-
Indexing Multidimensional Objects in a Large Semantic Cache
- bsnam,als¤ Semantic caches allow queries that require processing large scientific datasets to take advantage of cached objects, either directly or through automatic data transformations. During query planning, semantic information associated with each cached object is employed to locate all the obje
- Add To MetaCart
-
Towards a Knowledge Base Management System (KBMS): An Ontology-Aware Database Management System (DBMS)
- This paper aims to provide limited knowledge awareness to a conventional DBMS (Database Management Systems). This goal is achieved by extending an off-the-shelf DBMS (Postgresql in our case) in such way that it becomes ontology aware. The concept of ontology is used in our approach as a way of forma
- Cited by 6 (1 self) – Add To MetaCart
-
Multiple Query Optimization for Data Analysis Applications on Clusters of SMPs
- This paper is concerned with the efficient execution of multiple query workloads on a cluster of SMPs. We target applications that access and manipulate large scientific datasets. Queries in these applications involve userdefined processing operations on data and distributed data structures to hold
- Cited by 7 (5 self) – Add To MetaCart
-
Scheduling multiple data visualization query workloads on a shared memory machine
- hcma,als¤
- Cited by 11 (9 self) – Add To MetaCart
-
Active Proxy-G: Optimizing the Query Execution Process in the Grid
- The Grid environment facilitates collaborative work and allows many users to query and process data over geographically dispersed data repositories. Over the past several years, there has been a growing interest in developing applications that interactively analyze datasets, potentially in a collabo
- Cited by 8 (5 self) – Add To MetaCart
-
Decision Tree Construction for Data Mining on Cluster of Shared-Memory Multiprocessors
- Classification of very large datasets is a challenging problem in data mining. It is desirable to have decision-tree classifiers that can handle large datasets, because a large dataset often increases the accuracy of the resulting classification model. Classification tree algorithms can benefit from
- Cited by 2 (1 self) – Add To MetaCart
-
Exploiting Functional Decomposition for Efficient Parallel Processing of Multiple Data Analysis Queries
- Reuse is a powerful method for improving system performance. In this paper, we examine functional decomposition for improving data reuse, and therefore overall query execution performance, in the context of data analysis applications. Additionally, we look at the performance effects of using various
- Cited by 7 (3 self) – Add To MetaCart
-
Servicing Mixed Data Intensive Query Workloads
- When data analysis applications are employed in a multiclient environment, a data server must service multiple simultaneous queries, each of which may employ complex user-defined data structures and operations on the data. It is then necessary to harness inter- and intra-query commonalities and syst
- Cited by 1 (1 self) – Add To MetaCart

