Sciweavers

619 search results - page 60 / 124
» Query Planning in Infomaster
Sort
View
DBPL
1995
Springer
144views Database» more  DBPL 1995»
15 years 7 months ago
An Algebraic Framework for Physical OODB Design
Physical design for object-oriented databases is still in its infancy. Implementation decisions often intrude into the conceptual design (such as inverse links and object decompos...
Leonidas Fegaras, David Maier
WSDM
2012
ACM
243views Data Mining» more  WSDM 2012»
13 years 11 months ago
No search result left behind: branching behavior with browser tabs
Today’s Web browsers allow users to open links in new windows or tabs. This action, which we call ‘branching’, is sometimes performed on search results when the user plans t...
Jeff Huang, Thomas Lin, Ryen W. White
VLDB
2005
ACM
126views Database» more  VLDB 2005»
15 years 9 months ago
Consistently Estimating the Selectivity of Conjuncts of Predicates
Cost-based query optimizers need to estimate the selectivity of conjunctive predicates when comparing alternative query execution plans. To this end, advanced optimizers use multi...
Volker Markl, Nimrod Megiddo, Marcel Kutsch, Tam M...
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
16 years 4 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-Å...
SIGMOD
2005
ACM
119views Database» more  SIGMOD 2005»
16 years 4 months ago
Update-Pattern-Aware Modeling and Processing of Continuous Queries
A defining characteristic of continuous queries over on-line data streams, possibly bounded by sliding windows, is the potentially infinite and time-evolving nature of their input...
Lukasz Golab, M. Tamer Özsu