Sciweavers

14 search results - page 3 / 3
» Compressing Very Large Database Workloads for Continuous Onl...
Sort
View
VLDB
2004
ACM
118views Database» more  VLDB 2004»
13 years 11 months ago
On the performance of bitmap indices for high cardinality attributes
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
Kesheng Wu, Ekow J. Otoo, Arie Shoshani
EJASMP
2010
112views more  EJASMP 2010»
13 years 28 days ago
Query-Driven Strategy for On-the-Fly Term Spotting in Spontaneous Speech
Spoken utterance retrieval was largely studied in the last decades, with the purpose of indexing large audio databases or of detecting keywords in continuous speech streams. While...
Mickael Rouvier, Georges Linares, Benjamin Lecoute...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 8 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
WWW
2010
ACM
14 years 1 months ago
A pattern tree-based approach to learning URL normalization rules
Duplicate URLs have brought serious troubles to the whole pipeline of a search engine, from crawling, indexing, to result serving. URL normalization is to transform duplicate URLs...
Tao Lei, Rui Cai, Jiang-Ming Yang, Yan Ke, Xiaodon...