Sciweavers

736 search results - page 24 / 148
» Confidence-Aware Join Algorithms
Sort
View
PVLDB
2010
92views more  PVLDB 2010»
13 years 8 months ago
Proximity Rank Join
We introduce the proximity rank join problem, where we are given a set of relations whose tuples are equipped with a score and a real-valued feature vector. Given a target feature...
Davide Martinenghi, Marco Tagliasacchi
PODS
2001
ACM
135views Database» more  PODS 2001»
14 years 10 months ago
On the Complexity of Join Predicates
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Ka...
ICDE
1996
IEEE
134views Database» more  ICDE 1996»
14 years 11 months ago
Parallel Pointer-Based Join Algorithms in Memory-mapped Environments
Three pointer-based parallel join algorithms are presented and analyzed for environments in which secondary storage is made transparent to the programmer through memory mapping. B...
Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prab...
IJSWIS
2008
135views more  IJSWIS 2008»
13 years 9 months ago
Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF dat...
Artem Chebotko, Shiyong Lu, Mustafa Atay, Farshad ...
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
14 years 11 months ago
Closest-Point-of-Approach Join for Moving Object Histories
In applications that produce a large amount of data describing the paths of moving objects, there is a need to ask questions about the interaction of objects over a long recorded ...
Subramanian Arumugam, Chris Jermaine