Sciweavers

27 search results - page 3 / 6
» Partial Redundancy Elimination for Access Path Expressions
Sort
View
BMCBI
2008
204views more  BMCBI 2008»
13 years 7 months ago
EST2uni: an open, parallel tool for automated EST analysis and database creation, with a data mining web interface and microarra
Background: Expressed sequence tag (EST) collections are composed of a high number of single-pass, redundant, partial sequences, which need to be processed, clustered, and annotat...
Javier Forment, Francisco Gilabert Villamón...
VLDB
1995
ACM
129views Database» more  VLDB 1995»
13 years 11 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...
SIGMOD
1990
ACM
122views Database» more  SIGMOD 1990»
13 years 11 months ago
Access Support in Object Bases
In this work access support relataons are introduced as a means for optlmizmg query processing m object-oriented database systems The general idea 1s to mamtam redundant separate ...
Alfons Kemper, Guido Moerkotte
ICDE
2002
IEEE
181views Database» more  ICDE 2002»
14 years 13 days ago
YFilter: Efficient and Scalable Filtering of XML Documents
Soon, much of the data exchanged over the Internet will be encoded in XML, allowing for sophisticated filtering and content-based routing. We have built a filtering engine called ...
Yanlei Diao, Peter M. Fischer, Michael J. Franklin...
CODES
2007
IEEE
14 years 1 months ago
Compile-time decided instruction cache locking using worst-case execution paths
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access results in a definite cache hit or miss. This unpredictability i...
Heiko Falk, Sascha Plazar, Henrik Theiling