Sciweavers

1031 search results - page 111 / 207
» Indexing Information for Data Forensics
Sort
View
VLDB
2004
ACM
98views Database» more  VLDB 2004»
14 years 1 months ago
Top-k Query Evaluation with Probabilistic Guarantees
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
Martin Theobald, Gerhard Weikum, Ralf Schenkel
DAGSTUHL
2004
13 years 9 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
EDBT
2004
ACM
133views Database» more  EDBT 2004»
14 years 8 months ago
eVitae: An Event-Based Electronic Chronicle
We present an event based system for storing, managing, and presenting personal multimedia history. The development of such systems is a challenge because information about person...
Bin Wu, Rahul Singh, Punit Gupta, Ramesh Jain
CIKM
2010
Springer
13 years 6 months ago
Visual cube and on-line analytical processing of images
On-Line Analytical Processing (OLAP) has shown great success in many industry applications, including sales, marketing, management, financial data analysis, etc. In this paper, w...
Xin Jin, Jiawei Han, Liangliang Cao, Jiebo Luo, Bo...
CIKM
2009
Springer
14 years 21 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