Sciweavers

353 search results - page 64 / 71
» Processing Top-k Join Queries
Sort
View
DMDW
2001
307views Management» more  DMDW 2001»
13 years 9 months ago
An Analysis of Many-to-Many Relationships Between Fact and Dimension Tables in Dimensional Modeling
Star schema, which maintains one-to-many relationships between dimensions and a fact table, is widely accepted as the most viable data representation for dimensional analysis. Rea...
Il-Yeol Song, William Rowen, Carl Medsker, Edward ...
VLDB
2009
ACM
182views Database» more  VLDB 2009»
14 years 8 months ago
Guessing the extreme values in a data set: a Bayesian method and its applications
For a largenumber of data management problems, it would be very useful to be able to obtain a few samples from a data set, and to use the samples to guess the largest (or smallest)...
Mingxi Wu, Chris Jermaine
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
14 years 9 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
INFOCOM
2003
IEEE
14 years 1 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
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
14 years 6 days ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer