Sciweavers

951 search results - page 115 / 191
» Groupwise Processing of Relational Queries
Sort
View
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
15 years 11 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
105
Voted
INFOCOM
2003
IEEE
15 years 3 months ago
Associative Search in Peer to Peer Networks: Harnessing Latent Semantics
— The success of a P2P file-sharing network highly depends on the scalability and versatility of its search mechanism. Two particularly desirable search features are scope (abil...
Edith Cohen, Amos Fiat, Haim Kaplan
80
Voted
ACL
2012
13 years 18 days ago
Entailment-based Text Exploration with Application to the Health-care Domain
We present a novel text exploration model, which extends the scope of state-of-the-art technologies by moving from standard concept-based exploration to statement-based exploratio...
Meni Adler, Jonathan Berant, Ido Dagan
EUROPAR
2001
Springer
15 years 2 months ago
An Experimental Performance Evaluation of Join Algorithms for Parallel Object Databases
Abstract. Parallel relational databases have been successful in providing scalable performance for data intensive applications, and much work has been carried out on query processi...
Sandra de F. Mendes Sampaio, Jim Smith, Norman W. ...
96
Voted
PVLDB
2008
123views more  PVLDB 2008»
14 years 9 months ago
Dependable cardinality forecasts for XQuery
Though inevitable for effective cost-based query rewriting, the derivation of meaningful cardinality estimates has remained a notoriously hard problem in the context of XQuery. By...
Jens Teubner, Torsten Grust, Sebastian Maneth, She...