一大群
发表于 2025-3-25 03:21:56
Migadlisel Colòn,Nancy C. Walworthmortized time is .(log..+log..+1/.log...), where . is the size of the query result, and ... is a small constant, representing the number of times we must repeatedly apply the log. function to . before the result becomes ≤ 2.
bisphosphonate
发表于 2025-3-25 08:03:21
http://reply.papertrans.cn/15/1478/147710/147710_22.png
国家明智
发表于 2025-3-25 12:39:19
http://reply.papertrans.cn/15/1478/147710/147710_23.png
出汗
发表于 2025-3-25 18:24:15
Amanda S. Brooker,Karen M. Berkowitzmpute multiple aggregate queries in data cubes on a shared-nothing multiprocessor with high-bandwidth communication facilities. We evaluate the algorithms on the basis of analytical modeling and an implementation on an IBM SP2 system.
Allergic
发表于 2025-3-25 21:56:38
http://reply.papertrans.cn/15/1478/147710/147710_25.png
labile
发表于 2025-3-26 00:57:51
On the ubiquity of information services and the absence of guaranteed service quality,978-0-230-37184-2
Dorsal
发表于 2025-3-26 05:40:25
http://reply.papertrans.cn/15/1478/147710/147710_27.png
吗啡
发表于 2025-3-26 10:20:50
,HySpirit — A probabilistic inference engine for hypermedia retrieval in large databases,978-0-230-11640-5
intuition
发表于 2025-3-26 13:12:16
Pincer-search: A new algorithm for discovering the maximum frequent set,978-0-230-58944-5
Serenity
发表于 2025-3-26 17:03:06
Incremental generalization for mining in a data warehousing environment,978-0-230-51084-5