45 search results - page 7 / 9 » Optimal and Efficient Speculation-Based Partial Redundancy E... |
VLDB
1987
ACM
15 years 1 months ago
1987
ACM
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
101
click to vote
ICDE
2002
IEEE
15 years 2 months ago
2002
IEEE
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 ...
EDBT
2006
ACM
15 years 10 months ago
2006
ACM
Federated queries are regular relational queries accessing data on one or more remote relational or non-relational data sources, possibly combining them with tables stored in the ...
69
Voted
PLDI
1999
ACM
15 years 2 months ago
1999
ACM
Load-reuse analysis finds instructions that repeatedly access the same memory location. This location can be promoted to a register, eliminating redundant loads by reusing the re...
CGO
2005
IEEE
15 years 3 months ago
2005
IEEE
Many excepting instructions cannot be removed by existing Partial Redundancy Elimination (PRE) algorithms because the ordering constraints must be preserved between the excepting ...