Sciweavers

79 search results - page 13 / 16
» Optimizing Queries on Compressed Bitmaps
Sort
View
WWW
2007
ACM
14 years 8 months ago
Efficient search in large textual collections with redundancy
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
Jiangong Zhang, Torsten Suel
DASFAA
1997
IEEE
112views Database» more  DASFAA 1997»
13 years 12 months ago
Client-Server Optimization for Multimedia Document Exchange
The success of the World Wide Web is boosting the development of multimedia database systems and their integration into the internet. For the documents stored and exchanged in the...
Gerhard Köstler, Wolfgang L. J. Kowarschick, ...
FOCS
2000
IEEE
14 years 1 days ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 10 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
DLS
2010
204views Languages» more  DLS 2010»
13 years 5 months ago
Alias analysis for optimization of dynamic languages
Dynamic languages such as Python allow programs to be written more easily using high-level constructs such as comprehensions for queries and using generic code. Efficient executio...
Michael Gorbovitski, Yanhong A. Liu, Scott D. Stol...