Sciweavers

330 search results - page 2 / 66
» Random Indexing Revisited
Sort
View
ADC
2000
Springer
326views Database» more  ADC 2000»
14 years 26 days ago
T-Tree or B-Tree: Main Memory Database Index Structure Revisited
While the B-tree (or the B+ -tree) is the most popular index structure in disk-based relational database systems, the Ttree has been widely accepted as a promising index structure...
Hongjun Lu, Yuet Yeung Ng, Zengping Tian
CANDC
2004
ACM
13 years 8 months ago
Cycling in ecological networks: Finn's index revisited
A chief cybernetic feature of natural living systems is the recycling of nutrients, which tends to enhance stability and is one of the principal causes of ecosystem complexity. In...
Stefano Allesina, Robert E. Ulanowicz
WSDM
2010
ACM
259views Data Mining» more  WSDM 2010»
14 years 5 months ago
Revisiting Globally Sorted Indexes for Efficient Document Retrieval
There has been a large amount of research on efficient document retrieval in both IR and web search areas. One important technique to improve retrieval efficiency is early termina...
Fan Zhang, Shuming Shi, Hao Yan, Ji-Rong Wen
ADBIS
2007
Springer
107views Database» more  ADBIS 2007»
14 years 2 months ago
Indexing Mobile Objects on the Plane Revisited
Spyros Sioutas, Konstantinos Tsakalidis, Kostas Ts...
EMNLP
2006
13 years 10 months ago
Random Indexing using Statistical Weight Functions
Random Indexing is a vector space technique that provides an efficient and scalable approximation to distributional similarity problems. We present experiments showing Random Inde...
James Gorman, James R. Curran