Hi, I'm a student studying about asterixDB. While studying about AsterixDB, I sent you an e-mail because I had some questions.
When point or polygone data is inserted in AsterixDB, it says that "AsterixDB converts a class of indexes (that includes conventional B+ trees, R trees, and inverted indexes) into LSM-based secondary indexes," through Documentation or README on github, But I didn't know exactly how LSM B+tree or LSM R tree was implemented through the result of performing "localhost:19001" by driving AsterixDB . In addition, I want to how LSM B+tree or R tree generates a primary key when point or polygon data is inserted would also be checked as a result of execution screen of "localhost:19001" or the source code. (For example, Hilbert Curve, etc.) -> When inserting data, without inserting the primary key I created with point data. Do you happen to tell me about "how to verify that an LSM B+tree or LSM R tree is implemented" and "how to verify that it automatically generated a primary key (and indexing) such as Hilbert curve"? Thank you for reading it. And I sincerely look forward to your reply. >From Taehyeon Kwon ================================ *Taehyeon Kwon* Big Data Processing and DB Lab. Dept. of Computer Science and Engineering Sogang University, Seoul Korea Email : sungr...@gmail.com or sungr...@sogang.ac.kr ᐧ
