Sciweavers

240 search results - page 38 / 48
» A Fast Index for Semistructured Data
Sort
View
SSD
2007
Springer
124views Database» more  SSD 2007»
15 years 3 months ago
Querying Objects Modeled by Arbitrary Probability Distributions
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
Christian Böhm, Peter Kunath, Alexey Pryakhin...
NOMS
2010
IEEE
136views Communications» more  NOMS 2010»
14 years 8 months ago
Supporting System-wide Similarity Queries for networked system management
Abstract— Today’s networked systems are extensively instrumented for collecting a wealth of monitoring data. In this paper, we propose a framework called System-wide Similarity...
Songyun Duan, Hui Zhang 0002, Guofei Jiang, Xiaoqi...
ICDE
2001
IEEE
115views Database» more  ICDE 2001»
15 years 11 months ago
Incremental Computation and Maintenance of Temporal Aggregates
We consider the problems of computing aggregation queries in temporal databases, and of maintaining materialized temporal aggregate views efficiently. The latter problem is partic...
Jun Yang 0001, Jennifer Widom
ACSC
2000
IEEE
15 years 2 months ago
Needles and Haystacks: A Search Engine for Personal Information Collections
Information retrieval systems can be partitioned into two main classes: large-scale systems that make use of an inverted index or some other auxiliary data structure, intended for...
Owen de Kretser, Alistair Moffat
CIKM
2009
Springer
15 years 2 months ago
Space-economical partial gram indices for exact substring matching
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
Nan Tang, Lefteris Sidirourgos, Peter A. Boncz