Sciweavers

662 search results - page 2 / 133
» Approximate Queries and Representations for Large Data Seque...
Sort
View
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
12 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
SIGMOD
2004
ACM
199views Database» more  SIGMOD 2004»
14 years 5 months ago
Approximate XML Query Answers
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
ICDE
2010
IEEE
226views Database» more  ICDE 2010»
14 years 4 months ago
Approximation Trade-Offs in Markovian Stream Processing: An Empirical Study
Abstract-- A large amount of the world's data is both sequential and imprecise. Such data is commonly modeled as Markovian streams; examples include words/sentences inferred f...
Julie Letchner, Christopher Re, Magdalena Balazins...
BMCBI
2008
114views more  BMCBI 2008»
13 years 5 months ago
Visualization of large influenza virus sequence datasets using adaptively aggregated trees with sampling-based subscale represen
Background: With the amount of influenza genome sequence data growing rapidly, researchers need machine assistance in selecting datasets and exploring the data. Enhanced visualiza...
Leonid Zaslavsky, Yiming Bao, Tatiana A. Tatusova
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
14 years 4 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...