Sciweavers

491 search results - page 13 / 99
» Optimizing complex queries with multiple relation instances
Sort
View
IDEAS
2006
IEEE
100views Database» more  IDEAS 2006»
14 years 1 months ago
Data-Driven Publication of Relational Databases
The paper presents a framework for publishing relational databases in textual documents such as mails, HTML pages, LATEX or BibTex files, plain texts, etc. The publication proces...
Sonia Guehis, Philippe Rigaux, Emmanuel Waller
IPPS
2002
IEEE
14 years 13 days ago
Scheduling Multiple Data Visualization Query Workloads on a Shared Memory Machine
Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimi...
Henrique Andrade, Tahsin M. Kurç, Alan Suss...
AMW
2009
13 years 8 months ago
Identifying Algebraic Properties to Support Optimization of Unary Similarity Queries
Conventional operators for data retrieval are either based on exact matching or on total order relationship among elements. Neither of them is appropriate to manage complex data, s...
Mônica Ribeiro Porto Ferreira, Agma J. M. Tr...
ICDCS
1999
IEEE
13 years 11 months ago
Run-time Detection in Parallel and Distributed Systems: Application to Safety-Critical Systems
There is growing interest in run-time detection as parallel and distributed systems grow larger and more complex. This work targets run-time analysis of complex, interactive scien...
Beth Plale, Karsten Schwan
PEPM
2010
ACM
14 years 4 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein