Sciweavers

475 search results - page 11 / 95
» Efficient Set Similarity Joins Using Min-prefixes
Sort
View
ICDE
2007
IEEE
173views Database» more  ICDE 2007»
14 years 8 months ago
Adaptive Load Diffusion for Multiway Windowed Stream Joins
In this paper, we present an adaptive load diffusion operator to enable scalable processing of Multiway Windowed Stream Joins (MWSJs) using a cluster system. The load diffusion is...
Xiaohui Gu, Philip S. Yu, Haixun Wang
BMCBI
2008
139views more  BMCBI 2008»
13 years 7 months ago
A topological transformation in evolutionary tree search methods based on maximum likelihood combining p-ECR and neighbor joinin
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
Maozu Guo, Jian-Fu Li, Yang Liu
DAGSTUHL
2006
13 years 8 months ago
Efficient multi-step query processing for EMD-based similarity
Abstract. Similarity search in large multimedia databases requires efficient query processing based on suitable similarity models. Similarity models consist of a feature extraction...
Ira Assent, Thomas Seidl
ICDE
2006
IEEE
188views Database» more  ICDE 2006»
14 years 8 months ago
Efficiently Evaluating Order Preserving Similarity Queries over Historical Market-Basket Data
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
Reza Sherkat, Davood Rafiei
EDBT
2004
ACM
172views Database» more  EDBT 2004»
14 years 7 months ago
Efficient Similarity Search for Hierarchical Data in Large Databases
Structured and semi-structured object representations are getting more and more important for modern database applications. Examples for such data are hierarchical structures inclu...
Karin Kailing, Hans-Peter Kriegel, Stefan Schö...