Sciweavers

4886 search results - page 58 / 978
» Approximate Data Exchange
Sort
View
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
14 years 8 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey
SSDBM
2008
IEEE
111views Database» more  SSDBM 2008»
15 years 11 months ago
iJoin: Importance-Aware Join Approximation over Data Streams
We consider approximate join processing over data streams when memory limitations cause incoming tuples to overflow the available space, precluding exact processing. Selective evi...
Dhananjay Kulkarni, Chinya V. Ravishankar
APPML
2007
92views more  APPML 2007»
15 years 4 months ago
Topological grammars for data approximation
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
15 years 9 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
16 years 4 months ago
Approximately detecting duplicates for streaming data using stable bloom filters
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely eliminating duplicates in an unbounded data stream is not f...
Fan Deng, Davood Rafiei