登入選單
返回Google圖書搜尋
Vector Trees
Stephen C. Hirst
其他書名
A Data Structure for Fast Intersection
出版Basser Department of Computer Science, University of Sydney, 1992
ISBN08675862819780867586282
URLhttp://books.google.com.hk/books?id=X7a_AQAACAAJ&hl=&source=gbs_api
註釋Abstract: "In a recent technical report (Hirst, 92), we presented a new data structure called vector trees for implementing arbitrary subsets of the universal set of integers (0 ..., N-1). Unlike traditional structures such as sorted lists and bit vectors, vector trees prove to be space efficient over the entire range or cardinalities, and are more compact than the list and bit vector in the midrange. We demonstrated that since vector trees do not need to be unpacked to perform many of the standard set operations, the favourable space performance extends to the time domain. In this report, we perform a thorough analysis of set traversal, comparing a variety of algorithms using different primitive operations