Sciweavers

145 search results - page 4 / 29
» An efficient algorithm for partial order production
Sort
View
SIGMOD
2005
ACM
145views Database» more  SIGMOD 2005»
14 years 7 months ago
Stratified Computation of Skylines with Partially-Ordered Domains
In this paper, we study the evaluation of skyline queries with partially-ordered attributes. Because such attributes lack a total ordering, traditional index-based evaluation algo...
Chee Yong Chan, Pin-Kwang Eng, Kian-Lee Tan
BTW
2007
Springer
142views Database» more  BTW 2007»
14 years 1 months ago
Getting Prime Cuts from Skylines over Partially Ordered Domains
: Skyline queries have recently received a lot of attention due to their intuitive query formulation: users can state preferences with respect to several attributes. Unlike numeric...
Wolf-Tilo Balke, Wolf Siberski, Ulrich Güntze...
NAA
2000
Springer
97views Mathematics» more  NAA 2000»
13 years 11 months ago
Nested-Dissection Orderings for Sparse LU with Partial Pivoting
We describe the implementation and performance of a novel fill-minimization ordering technique for sparse LU factorization with partial pivoting. The technique was proposed by Gilb...
Igor Brainman, Sivan Toledo
SIGMOD
2009
ACM
291views Database» more  SIGMOD 2009»
14 years 7 months ago
Partial join order optimization in the paraccel analytic database
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
Yijou Chen, Richard L. Cole, William J. McKenna, S...
SODA
1990
ACM
49views Algorithms» more  SODA 1990»
13 years 8 months ago
Factor Refinement
Let O be an order of an algebraic number field. It was shown by Ge that given a factorization of an O-ideal a into a product of O-ideals it is possible to compute in polynomial tim...
Eric Bach, James R. Driscoll, Jeffrey Shallit