204 search results - page 25 / 41 » Flexible and efficient IR using array databases |
PODS
2006
ACM
15 years 10 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
CIKM
2006
Springer
14 years 11 months ago
2006
Springer
Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential abili...
TPDS
2010
14 years 8 months ago
2010
—This paper presents the development and implementation of a multiprocessor system-on-chip solution for fast and real time simulations of complex and nonlinear wheel-rail contact...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
VLDB
1992
ACM
15 years 1 months ago
1992
ACM
Most extensibledatabasesystemssupportaddition of new indexes or new data types. However, the referencepatterns exhibited by these new indexes may not be efficiently supportedby ex...