Sciweavers

475 search results - page 8 / 95
» Efficient Set Similarity Joins Using Min-prefixes
Sort
View
VLDB
2007
ACM
169views Database» more  VLDB 2007»
14 years 7 months ago
Peer-to-Peer Similarity Search in Metric Spaces
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
Christos Doulkeridis, Akrivi Vlachou, Yannis Kotid...
ICDE
2006
IEEE
119views Database» more  ICDE 2006»
14 years 8 months ago
Laws for Rewriting Queries Containing Division Operators
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
Ralf Rantzau, Christoph Mangold
SIGMOD
2006
ACM
117views Database» more  SIGMOD 2006»
14 years 7 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, ...
BMCBI
2007
106views more  BMCBI 2007»
13 years 7 months ago
Simultaneous identification of long similar substrings in large sets of sequences
Background: Sequence comparison faces new challenges today, with many complete genomes and large libraries of transcripts known. Gene annotation pipelines match these sequences in...
Jürgen Kleffe, Friedrich Möller, Burghar...
AIA
2006
13 years 8 months ago
Efficient Algorithm for Calculating Similarity between Trajectories Containing an Increasing Dimension
Time series data is usually stored and processed in the form of discrete trajectories of multidimensional measurement points. In order to compare the measurements of a query traje...
Perttu Laurinen, Pekka Siirtola, Juha Röning