Page 268 - 《软件学报》2021年第11期

3594 Journal of Software 软件学报 Vol.32, No.11, November 2021

[20] Fusco F, Vlachos M, Stoecklin MP. Real-time creation of bitmap indexes on streaming network data. The VLDB Journal, 2012,
21(3):287−307.
[21] Pu KQ, Zhu Y. Efficient indexing of heterogeneous data streams with automatic performance configurations. In: Proc. of the
Scientific and Statistical Database Management. IEEE, 2007. 34−34.
[22] Liu L, Pu C, Tang W. Continual queries for Internet scale event-driven information delivery. IEEE Trans. on Knowledge and Data
Engineering, 1999,11(4):583−590.
[23] Chen J, DeWitt DJ, Tian F, Wang Y. NiagraCQ: A scalable continuous query system for internet databases. In: Proc. of the
SIGMOD Conf. 2000. 379−390.
[24] Lin JC, Lee MC, Yu IC, Johnsen EB. Modeling and simulation of spark streaming. In: Proc. of the Int’l Conf. on Advanced
Information Networking and Applications. 2018. 407−413.
[25] Yan M, Wang L, Zomaya AY, Chen D, Ranjan R. Task-tree based large-scale mosaicking for massive remote sensed imageries with
dynamic DAG scheduling. IEEE Trans. on Parallel & Distributed Systems, 2014,25(8):2126−2137.
[26] Suna T. Opentsdb. 2017. http://opentsdb.net/
[27] Yang F, Tschetter E, Léauté X, Ray N, Merlino G, Ganguli D. Druid: A real-time analytical data store. In: Proc. of the ACM
SIGMOD Conf. 2014. 157−168.
[28] Pelkonen T, Franklin S, Teller J, Cavallaro P, Huang Q, Meza J, Veeraraghavan K. Gorilla: A fast, scalable, in-memory time series
database. Proc. of the VLDB Endowment, 2015,8(12):1816−1827.
[29] Knuth DE. The Art of Computer Programming. Pearson Education, 2005.
[30] Fagin R, Nievergelt J, Pippenger N, Strong HR. Extendible hashing: A fast access method for dynamic files. ACM Trans. on
Database Systems, 1979,4(3):315−344.
[31] Litwin W. Linear Hashing: A new tool for file and table addressing. In: Proc. of the VLDB Conf. 1980. 1−3.
[32] Aho AV, Hopcroft JE, Ullman JD. The Design and Analysis of Computer Algorithms. Pearson Education India, 1974.
[33] Comer D. The ubiquitous B-tree. ACM Computing Surveys, 1979,11(2):121−137.
[34] Lehman TJ, Carey MJ. A study of index structures for main memory database management systems. In: Proc. of the VLDB Conf.
1986. 294−303.
[35] Choi KR, Kim KC. T*-tree: A main memory database index structure for real time applications. In: Proc. of the Real-time
Computing Systems and Applications. 1996. 81−88.
[36] Lu H, Ng YY, Tian Z. T-tree or B-tree: Main memory database index structure revisited. In: Proc. of the Australian Database Conf.
2000. 65−73.
[37] Wu S, Jiang D, Ooi BC, Wu KL. Efficient B-tree based indexing for cloud data processing. Proc. of the VLDB Endowment, 2010,
3(1-2):1207−1218.
[38] Li X, Ren C, Yue M. A distributed real-time database index algorithm based on B+ tree and consistent hashing. Procedia
Engineering, 2011,24:171−176.
[39] He L, Chen JC, Du XY. Multi-layered index for HDFS-based system. Ruan Jian Xue Bao/Journal of Software, 2017,28(3):502−513
(in Chinese with English abstract). http://www.jos.org.cn/1000-9825/5161.htm [doi: 10.13328/j.cnki.jos.005161]
[40] Li B, Guo JW, Peng Q. Design of HBase secondary indexes for big data storage. Computing Technology and Automation, 2019,
38(2):124−129 (in Chinese with English abstract).
[41] Karger DR, Lehman E, Leighton T, Panigrahy R, Levine M, Lewin D. Consistent hashing and random trees: Distributed caching
protocols for relieving hot spots on the World Wide Web. In: Proc. of the Symp. on the Theory of Computing. 1997. 654−663.
[42] Van RR, Dumitriu D, Gough V, Thomas C. Efficient reconciliation and flow control for anti-entropy protocols. In: Proc. of the 2nd
Workshop on Large-scale Distributed Systems and Middleware. ACM, 2008. Article No.6.
[43] Aguilera MK, Golab W, Shah MA. A practical scalable distributed B-tree. In: Proc. of the VLDB Conf. 2008. 598−609.
[44] Ahmed M, Singh SS, Lee MJ. Lazy updates to indexes in a database. U.S. Patent 20090089334, 2009.
[45] Huang B, Peng YX. An efficient distributed B-tree index method in cloud computing. Open Cybernetics & Systemics Journal, 2014,
8:302−308.
[46] Bercken J, Seeger B. An evaluation of generic bulk loading techniques. In: Proc. of the VLDB Conf. 2001. 461−470.
[47] Lo ML, Ravishankar CV. The design and implementation of seeded trees: An efficient method for spatial joins. IEEE Trans. on
Knowledge and Data Engineering, 1998,10(1):136−152.
[48] Ciaccia P, Patella M. Bulk loading the M-tree. In: Proc. of the Australian Database Conf. 1998. 15−26.