Sciweavers

4397 search results - page 310 / 880
» Relational Algebra Operations
Sort
View
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
16 years 5 months ago
Rank-aware Query Optimization
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey ...
INTERNET
2007
105views more  INTERNET 2007»
15 years 4 months ago
Workflow Planning on a Grid
evel of abstraction, we can represent a workflow as a directed graph with operators (or tasks) at the vertices (see Figure 1). Each operator takes inputs from data sources or from ...
Craig W. Thompson, Wing Ning Li, Zhichun Xiao
CORR
2006
Springer
138views Education» more  CORR 2006»
15 years 4 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
ICFP
2007
ACM
16 years 4 months ago
Adding delimited and composable control to a production programming environment
Operators for delimiting control and for capturing composable continuations litter the landscape of theoretical programming language research. Numerous papers explain their advant...
Matthew Flatt, Gang Yu, Robert Bruce Findler, Matt...
ICALP
2005
Springer
15 years 10 months ago
Union-Find with Constant Time Deletions
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
Stephen Alstrup, Inge Li Gørtz, Theis Rauhe...