Relevant bibliographies by topics / Indexing tree structure

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Indexing tree structure'

Author: Grafiati
Published: 4 June 2021
Last updated: 14 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Indexing tree structure.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Indexing tree structure"

1

Song, Xiao Yu, Yong Hui Wang, and Shou Jin Wang. "The Study and Design of QR*-Tree Spatial Indexing Structure." Applied Mechanics and Materials 182-183 (June 2012): 2030–34. http://dx.doi.org/10.4028/www.scientific.net/amm.182-183.2030.

Full text
Abstract:
In this study, we will discuss a fast spatial indexing structure called QR*-tree based on R*-tree and quad-tree. Now, R*-tree and R-tree are widely used in spatial database as a spatial indexing structure, But for each algorithm alone, it is not suitable for the huge data volume. The hybrid structure that we proposed is composed of many R*-trees based on space partitioned by quad-tree. Although it demands more storage space than R*-tree or quad-tree, it gains better performance in insertion, deletion, and searching especially, and the more the amount of spatial data is, the better performance
APA, Harvard, Vancouver, ISO, and other styles
2

PETERLONGO, PIERRE, JULIEN ALLALI, and MARIE-FRANCE SAGOT. "INDEXING GAPPED-FACTORS USING A TREE." International Journal of Foundations of Computer Science 19, no. 01 (2008): 71–87. http://dx.doi.org/10.1142/s0129054108005541.

Full text
Abstract:
We present a data structure to index a specific kind of factors, that is of substrings, called gapped-factors. A gapped-factor is a factor containing a gap that is ignored during the indexation. The data structure presented is based on the suffix tree and indexes all the gapped-factors of a text with a fixed size of gap, and only those. The construction of this data structure is done online in linear time and space. Such a data structure may play an important role in various pattern matching and motif inference problems, for instance in text filtration.
APA, Harvard, Vancouver, ISO, and other styles
3

Jin, Peiquan, Hong Chen, Xujian Zhao, Xiaowen Li, and Lihua Yue. "Indexing temporal information for web pages." Computer Science and Information Systems 8, no. 3 (2011): 711–37. http://dx.doi.org/10.2298/csis100407025j.

Full text
Abstract:
Temporal information plays important roles in Web search, as Web pages intrinsically involve crawled time and most Web pages contain time keywords in their content. How to integrate temporal information in Web search engines has been a research focus in recent years, among which some key issues such as temporal-textual indexing and temporal information extraction have to be first studied. In this paper, we first present a framework of temporal-textual Web search engine. And then, we concentrate on designing a new hybrid index structure for temporal and textual information of Web pages. In part
APA, Harvard, Vancouver, ISO, and other styles
4

Pham, The-Anh, Sabine Barrat, Mathieu Delalandre, and Jean-Yves Ramel. "An efficient tree structure for indexing feature vectors." Pattern Recognition Letters 55 (April 2015): 42–50. http://dx.doi.org/10.1016/j.patrec.2014.08.006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zhou, Jianbin, Jin Ben, Rui Wang, Mingyang Zheng, and Lingyu Du. "Lattice Quad-Tree Indexing Algorithm for a Hexagonal Discrete Global Grid System." ISPRS International Journal of Geo-Information 9, no. 2 (2020): 83. http://dx.doi.org/10.3390/ijgi9020083.

Full text
Abstract:
Hexagonal discrete global grid systems are the preferred data models supporting multisource geospatial information fusion. Related research has aroused widespread concern in the academic community, and hierarchical indexing algorithms are one of the main research focuses. In this paper, we propose an algorithm for indexing the cell of a ringed spatial area based on a hexagonal lattice quad-tree (HLQT) structure and the indexing characteristics. First, we design a single-resolution indexing algorithm in which indexing starts from the initial quad tree and expands ring by ring using coding opera
APA, Harvard, Vancouver, ISO, and other styles
6

Barbar, Aziz, and Anis Ismail. "Stochastically Balancing Trees for File and Database Systems." International Journal of Green Computing 4, no. 1 (2013): 58–70. http://dx.doi.org/10.4018/jgc.2013010104.

Full text
Abstract:
With the constant improvement in data storage technologies, a new generation of indexing mechanisms is to be created to exploit the improvements in disk access speeds that were previously impractical. The self-balancing tree B-Tree, has long been the indexing structure of choice for reducing the amount of disk access at the expense of size of data block to be read or written. A new technique based on a dynamically growing multilevel list structure, which is stochastically balanced rather than self balanced, is discussed and compared to the B-Tree. An analogy between the technique and the struc
APA, Harvard, Vancouver, ISO, and other styles
7

Priya, R. Vishnu, and A. Vadivel. "Incremental Indexing for High-Dimensional Data using Tree Structure." Procedia Technology 6 (2012): 540–47. http://dx.doi.org/10.1016/j.protcy.2012.10.065.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Aouat, Saliha, and Slimane Larabi. "Object Retrieval Using the Quad-Tree Decomposition." Journal of Intelligent Systems 23, no. 1 (2014): 33–47. http://dx.doi.org/10.1515/jisys-2013-0014.

Full text
Abstract:
AbstractWe propose in this article an indexing and retrieval approach applied on outline shapes. Models of objects are stored in a database using the textual descriptors of their silhouettes. We extract from the textual description a set of efficient similarity measures to index the silhouettes. The extracted features are the geometric quasi-invariants that vary slightly with the small change in the viewpoint. We use a textual description and quasi-invariant features to minimize the storage space and to achieve an efficient indexing process. We also use the quad-tree structure to improve proce
APA, Harvard, Vancouver, ISO, and other styles
9

Gao, Rong Hua, and Hua Rui Wu. "Image Characteristics Indexing Based on X-Tree." Applied Mechanics and Materials 513-517 (February 2014): 3761–64. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.3761.

Full text
Abstract:
Image data set are usually very large, which might consist of millions of image objects, it is essential to use an efficient and effective indexing technique to facilitate speedy searching. The features can be expressed in terms of high-dimensional vector data which can be compared with a given query for similarity between them. It is more important that the image database should be preprocessed and establish indexing to improve retrieval efficiency. In this paper, the method of improved X-tree is proposed, design and implementation of a high dimensional index application to facilitate the spe
APA, Harvard, Vancouver, ISO, and other styles
10

Huang, Bo, and Qiang Wu. "A Spatial Indexing Approach for High Performance Location Based Services." Journal of Navigation 60, no. 1 (2006): 83–93. http://dx.doi.org/10.1017/s0373463307004043.

Full text
Abstract:
The rapid development of positioning technology, wireless communication and mobile devices has given rise to the exciting Location Based Services (LBS) thus significantly influencing existing navigational procedures. Motivated by the increasing need to search efficiently through a huge number of service locations (e.g. restaurants, hotels, shops, and more), this paper presents an efficient spatial index QR-tree, a hybrid index structure of Quadtree and R-tree, instead of the exhaustive search to improve the performance in response to user queries. QR-tree consists of two levels: the upper leve
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Indexing tree structure"

1

Křížová, Martina. "Indexování dat pohybujících se objektů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2010. http://www.nusl.cz/ntk/nusl-237256.

Full text
Abstract:
This thesis deals with indexing of spatio-temporal data. It describes existing approaches to indexing data and support for indexing in Oracle Database 11g. The aim of this work is to design structures of databases for storing spatio-temporal data over Oracle Database 11g to propose experiments for these databases. Ways of spatio-temporal data storage are evaluated according to these experiments in terms of time demands of queries and appropriateness of using available indexing structure and spatial operators.
APA, Harvard, Vancouver, ISO, and other styles
2

Lisák, Peter. "Rozpoznávání člověka podle žil prstu." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2011. http://www.nusl.cz/ntk/nusl-236991.

Full text
Abstract:
The master's thesis deals with biometric systems, especially these based on human recognition by finger veins. It describes some development principles of the new biometric system. It proposes some new approaches to the comparison of finger vein patterns and their fast identification in sizable databases. Verification is based on templates comparison by similarity and distance measures with proposed alignment approaches. The proposed method of identification is based on the combination of clustering and genetic algorithm. The second option is using the indexing tree structure and searching by
APA, Harvard, Vancouver, ISO, and other styles
3

Vasaitis, Vasileios. "Novel storage architectures and pointer-free search trees for database systems." Thesis, University of Edinburgh, 2012. http://hdl.handle.net/1842/6240.

Full text
Abstract:
Database systems research is an old and well-established field in computer science. Many of the key concepts appeared as early as the 60s, while the core of relational databases, which have dominated the database world for a while now, was solidified during the 80s. However, the underlying hardware has not displayed such stability in the same period, which means that a lot of assumptions that were made about the hardware by early database systems are not necessarily true for modern computer architectures. In particular, over the last few decades there have been two notable consistent trends in
APA, Harvard, Vancouver, ISO, and other styles
4

SILVA, Israel Batista Freitas da. "Representações cache eficientes para índices baseados em Wavelet trees." Universidade Federal de Pernambuco, 2016. https://repositorio.ufpe.br/handle/123456789/21050.

Full text
Abstract:
Submitted by Rafael Santana (rafael.silvasantana@ufpe.br) on 2017-08-30T19:22:34Z No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) Israel Batista Freitas da Silva.pdf: 1433243 bytes, checksum: 5b1ac5501cae385e4811343e1426e6c9 (MD5)<br>Made available in DSpace on 2017-08-30T19:22:34Z (GMT). No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) Israel Batista Freitas da Silva.pdf: 1433243 bytes, checksum: 5b1ac5501cae385e4811343e1426e6c9 (MD5) Previous issue date: 2016-12-12<br>CNPQ, FACEPE.<br>Hoje em d
APA, Harvard, Vancouver, ISO, and other styles
5

Douieb, Karim. "Hotlinks and dictionaries." Doctoral thesis, Universite Libre de Bruxelles, 2008. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210471.

Full text
Abstract:
Knowledge has always been a decisive factor of humankind's social evolutions. Collecting the world's knowledge is one of the greatest challenges of our civilization. Knowledge involves the use of information but information is not knowledge. It is a way of acquiring and understanding information. Improving the visibility and the accessibility of information requires to organize it efficiently. This thesis focuses on this general purpose.<p><p>A fundamental objective of computer science is to store and retrieve information efficiently. This is known as the dictionary problem. A dictionary asks
APA, Harvard, Vancouver, ISO, and other styles
6

Chang, Gush, and 張楷鑫. "noneA fast access indexing tree structure developed based on PAT tree." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/43154970093402284385.

Full text
Abstract:
碩士<br>國立中央大學<br>資訊管理研究所<br>97<br>In the era of the Internet and distributed multimedia computing, data increasesrapidly in astonishing rate. How to retrieve data efficiently has become an urgentissue. The PAT tree is a data structure that allows very efficient searching withpreprocessing. We can do arbitrary prefix searching in O(log n) time with PAT tree,independent of the size of the answer. In practice, the length of the query is less thanO(log n), and the searching time is proportional to the query length. To improve thesearching efficiency, we have developed a modified PAT tree called dec
APA, Harvard, Vancouver, ISO, and other styles
7

Hsu, Chia-Yun, and 許嘉允. "Video Retrieval Using the Indexing Structure R-tree Based on Motion of Objects." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/84as6q.

Full text
Abstract:
碩士<br>淡江大學<br>資訊管理學系碩士班<br>104<br>By the growth of the technology and internet, a huge amount of multi-media data, such as video, have been created on the internet. However, searching for the pieces you want from this massive video database can be extremely challenging. A video can be seen as a series of frames. Video search based on the object in the video is an effective method. However, in previous studies, most of work is based on the location of the object. The information about the change of the relationship between objects in the continuous frames is not considered. In continuous frame
APA, Harvard, Vancouver, ISO, and other styles
8

"Free tree-featured graph indexing and query processing." Thesis, 2007. http://library.cuhk.edu.hk/record=b6074432.

Full text
Abstract:
In this dissertation, we develop frequent free tree mining systems, F3TM and CFFTree, to systematically discover the complete set of (closed) frequent free trees from a graph database. Graph indexing, another problem addressed in this dissertation, is of special interest both in academia and in industrial applications. The solutions, (Tree+Delta ) and SimTree, propose a free tree featured index, which is built on frequent free tree patterns discovered through a structural mining process. This mining-based indexing methodology leads to the development of a compact but effective graph index str
APA, Harvard, Vancouver, ISO, and other styles
9

Fan, Yang Wen, and 范揚文. "SL-trees: A Indexing Structure for Object-Oriented Databases." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/11127675450027085129.

Full text
Abstract:
碩士<br>國立中正大學<br>資訊工程研究所<br>81<br>In an object-oriented database, the scope of a query is often a class hierarchy rooted at a particular class. That is, a query may either request instances chosen only from a root class, or it may request instances which are chosen from any subclass of the root class. So, the database indexing method must support efficient retrieval from either a single class or from a hierarchy of classes.In this paper,we propose a new hierarchical indexing str
APA, Harvard, Vancouver, ISO, and other styles
10

Lin, Yen-chang, and 林彥昌. "A Study of Using Multiple Ki-ary Tree for Structured Indexing on XML Documents." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/rc95wk.

Full text
Abstract:
碩士<br>靜宜大學<br>資訊管理學系研究所<br>94<br>In recent years XML(Extensible Markup Language) has become a very popular research topic and it has been used to be a basis of transmission and exchange for many document formats. For example, Taiwanese government has endeavored to promote electronic form of official documents and exchanges of electronic official documents in recent years, whose transmission standard are based on XML. XML could be said to be the most developed standard for storing and transmitting information on the Internet at present time. To create structured index and to provide structured
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Indexing tree structure"

1

Bonnici, Vincenzo, Alfredo Ferro, Rosalba Giugno, Alfredo Pulvirenti, and Dennis Shasha. "Enhancing Graph Database Indexing by Suffix Tree Structure." In Pattern Recognition in Bioinformatics. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16001-1_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Mingming, and Shinichiro Omachi. "Indexing Tree and Subtree by Using a Structure Network." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14980-1_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

De Vries, Christopher M., Shlomo Geva, and Lance De Vine. "Clustering with Random Indexing K-tree and XML Structure." In Focused Retrieval and Evaluation. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14556-8_40.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cappelli, Raffaele, Alessandra Lumini, and Dario Maio. "MKL-Tree: A Hierarchical Data Structure for Indexing Multidimensional Data." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-46146-9_90.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Ben, and John Q. Gan. "SC-Tree: An Efficient Structure for High-Dimensional Data Indexing." In Flexible and Efficient Information Handling. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11788911_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pham, The-Anh, Sabine Barrat, Mathieu Delalandre, and Jean-Yves Ramel. "An Efficient Indexing Scheme Based on Linked-Node m-Ary Tree Structure." In Image Analysis and Processing – ICIAP 2013. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41181-6_76.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hart, Quinn, Michael Gertz, and Jie Zhang. "Evaluation of a Dynamic Tree Structure for Indexing Query Regions on Streaming Geospatial Data." In Advances in Spatial and Temporal Databases. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11535331_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Manolopoulos, Yannis, Alexandros Nanopoulos, and Eleni Tousidou. "Signature Indexing with Tree Structures." In Advances in Database Systems. Springer US, 2003. http://dx.doi.org/10.1007/978-1-4419-8636-8_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gao, Feng, and Mohammed J. Zaki. "Indexing Protein Structures Using Suffix Trees." In Protein Structure Prediction. Humana Press, 2008. http://dx.doi.org/10.1007/978-1-59745-574-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Yilmaz, Fadi, and M. Fatih Demirci. "Indexing Tree Structures through Caterpillar Decomposition." In Image Analysis. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21227-7_64.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Indexing tree structure"

1

Zhang, Xiang, and Huaping Chen. "Indexing Ontological Structure Based on Neighbor Tree." In 2010 International Conference on Technologies and Applications of Artificial Intelligence (TAAI). IEEE, 2010. http://dx.doi.org/10.1109/taai.2010.51.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Liu, Lian, Fenghong Xiang, Jianlin Mao, and Maoxing Zhang. "High-dimensional indexing algorithm based on the hyperplane tree-structure." In 2015 IEEE International Conference on Information and Automation (ICIA). IEEE, 2015. http://dx.doi.org/10.1109/icinfa.2015.7279748.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tan, Ning, and Yue-xiang Shi. "Optimization Reearch of Multi-dimensional Indexing Structure of R*-Tree." In 2009 International Forum on Information Technology and Applications (IFITA). IEEE, 2009. http://dx.doi.org/10.1109/ifita.2009.523.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tak, Yoon-Sik, and Eenjun Hwang. "Tertiary Hash Tree: Indexing Structure for Content-Based Image Retrieval." In 2010 20th International Conference on Pattern Recognition (ICPR). IEEE, 2010. http://dx.doi.org/10.1109/icpr.2010.775.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Najjar, Faiza, and Hassenet Slimani. "Compact N-tree: an indexing structure for distance range queries." In 2009 IEEE Symposium on Computers and Communications (ISCC). IEEE, 2009. http://dx.doi.org/10.1109/iscc.2009.5202326.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fleites, Fausto C., Shu-Ching Chen, and Kasturi Chatterjee. "AH+-Tree: An Efficient Multimedia Indexing Structure for Similarity Queries." In 2011 IEEE International Symposium on Multimedia (ISM). IEEE, 2011. http://dx.doi.org/10.1109/ism.2011.20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Huang, Hai, Ying Hou, Li-Xiong Liu, and Fu-Cai Chen. "MB-tree: A quick indexing structure for multi-dimensional space." In 2010 3rd International Conference on Advanced Computer Theory and Engineering (ICACTE 2010). IEEE, 2010. http://dx.doi.org/10.1109/icacte.2010.5579432.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Almajali, Sufyan, Ghazi Al-Naymat, and Ayah Atiyah. "Bpoint-tree: An Indexing Structure for Efficient Search in Data Retrieval." In 2018 Fourth International Conference on Advances in Computing, Communication & Automation (ICACCA). IEEE, 2018. http://dx.doi.org/10.1109/icaccaf.2018.8776727.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jaber, Khalid, Rosni Abdullah, and Nur'Aini Abdul Rashid. "Indexing protein sequence/ structure databases using decision tree: A preliminary study." In 2010 International Symposium on Information Technology (ITSim 2010). IEEE, 2010. http://dx.doi.org/10.1109/itsim.2010.5561558.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Run-Tao Liu and Zhong-Xiao Hao. "A spatial indexing structure based on object partition_ br-tree." In 2007 International Conference on Wavelet Analysis and Pattern Recognition. IEEE, 2007. http://dx.doi.org/10.1109/icwapr.2007.4420696.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography