Sciweavers

4397 search results - page 366 / 880
» Relational Algebra Operations
Sort
View
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
15 years 12 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
BTW
2007
Springer
114views Database» more  BTW 2007»
15 years 11 months ago
Transformation of Models in(to) a Generic Metamodel
: Model Management aims at developing new technologies and mechanisms to support the integration, evolution and matching of models. Such tasks are to be performed by means of a set...
David Kensche, Christoph Quix
SGP
2004
15 years 7 months ago
Laplacian Surface Editing
Surface editing operations commonly require geometric details of the surface to be preserved as much as possible. We argue that geometric detail is an intrinsic property of a surf...
Olga Sorkine, Daniel Cohen-Or, Yaron Lipman, Marc ...
USENIX
2008
15 years 7 months ago
Optimizing TCP Receive Performance
The performance of receive side TCP processing has traditionally been dominated by the cost of the `per-byte' operations, such as data copying and checksumming. We show that ...
Aravind Menon, Willy Zwaenepoel
PODS
2003
ACM
158views Database» more  PODS 2003»
16 years 5 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv