Sciweavers

139 search results - page 23 / 28
» Compression of inverted indexes for fast query evaluation
Sort
View
SSD
2007
Springer
124views Database» more  SSD 2007»
14 years 1 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...
CIKM
2009
Springer
14 years 2 days 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
NOMS
2010
IEEE
136views Communications» more  NOMS 2010»
13 years 5 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...
SIGMOD
2007
ACM
179views Database» more  SIGMOD 2007»
14 years 7 months ago
How to barter bits for chronons: compression and bandwidth trade offs for database scans
Two trends are converging to make the CPU cost of a table scan a more important component of database performance. First, table scans are becoming a larger fraction of the query p...
Allison L. Holloway, Vijayshankar Raman, Garret Sw...
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
14 years 8 days ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...