Implementing a Serial and Concurrent Oblivious Tree Data Structure based on a 2-3 Tree utilizing Java. This is an academic project for COP6616 Multicore Programming.
This project is NOT related to cache obliviousness.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001055s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.079934s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001039s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001427s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001091s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003341s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000964s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003788s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014590s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001125s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 97272 [ RunTime:0.016606s ]
