Sciweavers

4397 search results - page 150 / 880
» Relational Algebra Operations
Sort
View
194
Voted
ICDE
2001
IEEE
104views Database» more  ICDE 2001»
16 years 4 months ago
Efficient Bulk Deletes in Relational Databases
Many applications require that large amounts of data are deleted from the database ? typically, such bulk deletes are carried out periodically and involve old or out-of-date data....
Andreas Gärtner, Alfons Kemper, Donald Kossma...
ISI
2004
Springer
15 years 8 months ago
Privacy-Preserving Inter-database Operations
Abstract. We present protocols for distributed computation of relational intersections and equi-joins such that each site gains no information about the tuples at the other site th...
Gang Liang, Sudarshan S. Chawathe
124
Voted
SIGMOD
2004
ACM
156views Database» more  SIGMOD 2004»
16 years 2 months ago
Tree Logical Classes for Efficient Evaluation of XQuery
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
Stelios Paparizos, Yuqing Wu, Laks V. S. Lakshmana...
PPSC
1989
15 years 3 months ago
Evaluating Block Algorithm Variants in LAPACK
The LAPACK software project currently under development is intended to provide a portable linear algebra library for high performance computers. LAPACK will make use of the Level 1...
Ed Anderson, Jack Dongarra
COLING
2002
15 years 2 months ago
A Corpus-based Analysis for the Ordering of Clause Aggregation Operators
To better understand the ordering of clause aggregation operators in a text generation application, we manually annotated a small corpus. The annotated corpus supports the preferr...
James Shaw