3481 search results - page 501 / 697 » Exploration in Relational Worlds |
231
click to vote
SIGMOD
2006
ACM
16 years 5 months ago
2006
ACM
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
228
click to vote
SIGMOD
2005
ACM
16 years 5 months ago
2005
ACM
There has been an information explosion in fields of science such as high energy physics, astronomy, environmental sciences and biology. There is a critical need for automated sys...
141
click to vote
EDBT
2008
ACM
16 years 5 months ago
2008
ACM
Conceptual complexity is emerging as a new bottleneck as data-base developers, application developers, and database administrators struggle to design and comprehend large, complex...
148
click to vote
ICFP
2007
ACM
16 years 5 months ago
2007
ACM
Operators for delimiting control and for capturing composable continuations litter the landscape of theoretical programming language research. Numerous papers explain their advant...
172
click to vote
ICDE
2010
IEEE
16 years 5 months ago
2010
IEEE
An ever-increasing amount of data and semantic knowledge in the domain of life sciences is bringing about new data management challenges. In this paper we focus on adding the seman...