mirror of
https://github.com/not-kennethreitz/convore.json.git
synced 2026-06-21 15:40:58 +00:00
Kenneth Reitz
1 line
3.0 KiB
JSON
1 line
3.0 KiB
JSON
[{"user_id": 2557, "stars": [], "topic_id": 18377, "date_created": 1302452554.6522191, "message": "http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.95.6341&rep=rep1&type=pdf", "group_id": 12, "id": 610475}, {"user_id": 3611, "stars": [], "topic_id": 18377, "date_created": 1302451934.2878051, "message": "http://www.scpe.org/vols/vol08/no3/SCPE_8_3_07.pdf", "group_id": 12, "id": 610345}, {"user_id": 2557, "stars": [], "topic_id": 18377, "date_created": 1302452653.4990661, "message": "Looks quite interesting for a system with consistent hashing, analytics are def. important and will become a significant part of what big data means in the future.", "group_id": 12, "id": 610491}, {"user_id": 3611, "stars": [], "topic_id": 18377, "date_created": 1302451960.3364041, "message": "Abstract. Supporting range query over Peer-to-Peer systems has attracted many research e\ufb00orts in recent years. In this paper, we propose a new multidimensional indexing structure for P2P systems called Distributed Hilbert R-trees (DHR-trees). DHR-trees enables multidimensional range query to be executed similarly as in overlapping regions tree in P2P systems. Its distributed structure makes it fault-tolerant and scalable to dynamic network environment with a large number of peers as well. Our experiments shows that it performs well on multidimensional range query while the maintenance cost is reasonably low.", "group_id": 12, "id": 610351}, {"user_id": 2557, "stars": [], "topic_id": 18377, "date_created": 1302452530.8611701, "message": "Broken link?", "group_id": 12, "id": 610474}, {"user_id": 1060, "stars": [], "topic_id": 18377, "date_created": 1302455914.8642321, "message": "The R*-tree became the de facto multi-dimensional index in many RDBMSes", "group_id": 12, "id": 611314}, {"user_id": 1060, "stars": [], "topic_id": 18377, "date_created": 1302455961.543267, "message": "The authors of the R*-tree have a revised design: http://portal.acm.org/citation.cfm?id=1559845.1559929", "group_id": 12, "id": 611339}, {"user_id": 1060, "stars": [], "topic_id": 18377, "date_created": 1302455796.4635799, "message": "There have been some interesting improvements on the original R-tree recently", "group_id": 12, "id": 611264}, {"user_id": 1060, "stars": [], "topic_id": 18377, "date_created": 1302456069.5391531, "message": "Not sure however how amenable the R*-tree is to a distributed environment", "group_id": 12, "id": 611369}, {"user_id": 1060, "stars": [], "topic_id": 18377, "date_created": 1302456043.9052639, "message": "They improved concurrency and query performance", "group_id": 12, "id": 611364}, {"user_id": 11, "stars": [], "topic_id": 18377, "date_created": 1302543423.0502551, "message": "We've had problems with r-trees in general in a distributed environment. Too much shared state.", "group_id": 12, "id": 626830}, {"user_id": 3611, "stars": [], "topic_id": 18377, "date_created": 1302700593.8185661, "message": "@mmalone I'd be interested to hear what your problems were, especially if they go beyond what you have said in your presentations.", "group_id": 12, "id": 664711}] |