Sciweavers

287 search results - page 26 / 58
» Optimization Techniques for Queries with Expensive Methods
Sort
View
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
15 years 4 months ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
121
Voted
ICDE
2010
IEEE
249views Database» more  ICDE 2010»
15 years 7 months ago
PARINET: A tunable access method for in-network trajectories
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, ...
SAS
2001
Springer
166views Formal Methods» more  SAS 2001»
15 years 4 months ago
Estimating the Impact of Scalable Pointer Analysis on Optimization
This paper addresses the following question: Do scalable control-flow-insensitive pointer analyses provide the level of precision required to make them useful in compiler optimiza...
Manuvir Das, Ben Liblit, Manuel Fähndrich, Ja...
ICDE
2000
IEEE
125views Database» more  ICDE 2000»
16 years 1 months ago
An Algebraic Compression Framework for Query Results
Decision-support applications in emerging environments require that SQL query results or intermediate results be shipped to clients for further analysis and presentation. These cl...
Zhiyuan Chen, Praveen Seshadri
KDD
1997
ACM
131views Data Mining» more  KDD 1997»
15 years 4 months ago
Discovery of Actionable Patterns in Databases: The Action Hierarchy Approach
An approach to defining actionability as a measure of interestingness of patterns is proposed. This approach is based on the concept of an action hierarchy which is defined as a t...
Gediminas Adomavicius, Alexander Tuzhilin