Sciweavers

431 search results - page 56 / 87
» KPYR: An Efficient Indexing Method
Sort
View
EDBT
2004
ACM
162views Database» more  EDBT 2004»
14 years 9 months ago
Non-contiguous Sequence Pattern Queries
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodo...
Nikos Mamoulis, Man Lung Yiu
ICDE
2005
IEEE
139views Database» more  ICDE 2005»
14 years 10 months ago
Compressing Bitmap Indices by Data Reorganization
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 1 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
BMCBI
2008
105views more  BMCBI 2008»
13 years 9 months ago
Using the longest significance run to estimate region-specific p-values in genetic association mapping studies
Background: Association testing is a powerful tool for identifying disease susceptibility genes underlying complex diseases. Technological advances have yielded a dramatic increas...
Ie-Bin Lian, Yi-Hsien Lin, Ying-Chao Lin, Hsin-Cho...
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
13 years 3 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...