Sciweavers

99 search results - page 10 / 20
» Efficiently evaluating complex boolean expressions
Sort
View
ICCAD
2010
IEEE
124views Hardware» more  ICCAD 2010»
13 years 6 months ago
Symbolic performance analysis of elastic systems
Elastic systems, either synchronous or asynchronous, can be optimized for the average-case performance when they have units with early evaluation or variable latency. The performan...
Marc Galceran Oms, Jordi Cortadella, Michael Kishi...
VLDB
2007
ACM
126views Database» more  VLDB 2007»
14 years 8 months ago
Querying Complex Structured Databases
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
Cong Yu, H. V. Jagadish
SSDBM
2009
IEEE
174views Database» more  SSDBM 2009»
14 years 3 months ago
Optimization and Execution of Complex Scientific Queries over Uncorrelated Experimental Data
Scientific experiments produce large volumes of data represented as complex objects that describe independent events such as particle collisions. Scientific analyses can be express...
Ruslan Fomkin, Tore Risch
VLDB
1995
ACM
129views Database» more  VLDB 1995»
13 years 12 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...
PLDI
2009
ACM
14 years 3 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...