Sciweavers

475 search results - page 43 / 95
» Efficient Set Similarity Joins Using Min-prefixes
Sort
View
EDBT
2008
ACM
156views Database» more  EDBT 2008»
14 years 7 months ago
Online recovery in cluster databases
Cluster based replication solutions are an attractive mechanism to provide both high-availability and scalability for the database backend within the multi-tier information system...
WeiBin Liang, Bettina Kemme
VLDB
1997
ACM
126views Database» more  VLDB 1997»
13 years 11 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
VLDB
2003
ACM
147views Database» more  VLDB 2003»
14 years 7 months ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...
FOCS
2009
IEEE
13 years 11 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
ICDM
2007
IEEE
176views Data Mining» more  ICDM 2007»
13 years 11 months ago
A Compact Representation of Spatio-Temporal Data
As technology advances we encounter more available data on moving objects, which can be mined to our benefit. In order to efficiently mine this large amount of data we propose an ...
Sigal Elnekave, Mark Last, Oded Maimon