Sciweavers

150 search results - page 22 / 30
» sigmod 2008
Sort
View
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 10 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
SIGMOD
2008
ACM
203views Database» more  SIGMOD 2008»
14 years 10 months ago
Querying continuous functions in a database system
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
Arvind Thiagarajan, Samuel Madden
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
14 years 10 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
SIGMOD
2008
ACM
89views Database» more  SIGMOD 2008»
14 years 10 months ago
Towards identity anonymization on graphs
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
Kun Liu, Evimaria Terzi
SIGMOD
2008
ACM
162views Database» more  SIGMOD 2008»
14 years 10 months ago
Event queries on correlated probabilistic streams
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
Christopher Ré, Dan Suciu, Julie Letchner, ...