Sciweavers

528 search results - page 11 / 106
» The Similarity Join Database Operator
Sort
View
ICDE
2008
IEEE
395views Database» more  ICDE 2008»
16 years 9 months ago
PermJoin: An Efficient Algorithm for Producing Early Results in Multi-join Query Plans
This paper introduces an efficient algorithm for Producing Early Results in Multi-join query plans (PermJoin, for short). While most previous research focuses only on the case of ...
Justin J. Levandoski, Mohamed E. Khalefa, Mohamed ...
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
15 years 9 months ago
Efficient Processing of Joins on Set-valued Attributes
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
Nikos Mamoulis
140
Voted
SIGMOD
2006
ACM
117views Database» more  SIGMOD 2006»
15 years 9 months ago
Database support for matching: limitations and opportunities
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...
Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, ...
SAC
2006
ACM
15 years 3 months ago
Imprecise RDQL: towards generic retrieval in ontologies using similarity joins
Traditional semantic web query languages support a logicbased access to the semantic web. They offer a retrieval (or reasoning) of data based on facts. On the traditional web and...
Abraham Bernstein, Christoph Kiefer
AINA
2007
IEEE
15 years 1 months ago
Improving distributed join efficiency with extended bloom filter operations
Bloom filter based algorithms have proven successful as very efficient technique to reduce communication costs of database joins in a distributed setting. However, the full potent...
Loizos Michael, Wolfgang Nejdl, Odysseas Papapetro...