Sciweavers

2089 search results - page 155 / 418
» A New Problem in String Searching
Sort
View
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
15 years 2 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
SIGMOD
2005
ACM
126views Database» more  SIGMOD 2005»
15 years 3 months ago
Page Quality: In Search of an Unbiased Web Ranking
In a number of recent studies [4, 8] researchers have found that because search engines repeatedly return currently popular pages at the top of search results, popular pages tend ...
Junghoo Cho, Sourashis Roy, Robert Adams
SIGMOD
2010
ACM
210views Database» more  SIGMOD 2010»
14 years 10 months ago
Searching trajectories by locations: an efficiency study
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new probl...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Yu Zhen...
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
15 years 10 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
ICDE
2009
IEEE
184views Database» more  ICDE 2009»
15 years 4 months ago
Scalable Keyword Search on Large Data Streams
Abstract— It is widely realized that the integration of information retrieval (IR) and database (DB) techniques provides users with a broad range of high quality services. A new ...
Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao