Sciweavers

39 search results - page 2 / 8
» Efficient Algorithm for determining the Optimal Execution St...
Sort
View
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
14 years 5 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy
ICLP
2007
Springer
13 years 9 months ago
OnEQL: An Ontology Efficient Query Language Engine for the Semantic Web
Abstract. In this paper we describe the OnEQL system, a query engine that implements optimization techniques and evaluation strategies to speed up the evaluation time of querying a...
Edna Ruckhaus, Maria-Esther Vidal, Eduardo Ruiz
VLDB
1995
ACM
129views Database» more  VLDB 1995»
13 years 8 months ago
A Cost Model for Clustered Object-Oriented Databases
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
Georges Gardarin, Jean-Robert Gruser, Zhao-Hui Tan...
ESCIENCE
2007
IEEE
13 years 11 months ago
A Dynamic Critical Path Algorithm for Scheduling Scientific Workflow Applications on Global Grids
Effective scheduling is a key concern for the execution of performance driven Grid applications. In this paper, we propose a Dynamic Critical Path (DCP) based workflow scheduling ...
Mustafizur Rahman 0003, Srikumar Venugopal, Rajkum...
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
14 years 5 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...