Also, there are techniques which have worked very well in performance optimization for relational databases. Yet these techniques are in the process of integration into big data analytics. Indexing and its data structure is an example of such techniques. Despite its popularity in query optimization ...
Indexing bitemporal databases as points A bitemporal database supports both the valid and transaction time dimensions. Records in such a database can be viewed as a rectangle in a 2-dimensional s... BC Ooi,HG Cheng,KL Tan - 《Information & Software Technology》 被引量: 4发表: 1998年 ...
We propose TEDI, an indexing for solving shortest path, and k Nearest Neighbors (kNN) problems. TEDI is based on the tree decomposition methodology. The graph is first decomposed into a tree in which the node contains vertices. The shortest paths are stored in such nodes. These local shortest...
Spatial/temporal databasesIndexing methodsMoving objectsIndoor spacesWith the increasing popularity of indoor positioning system technologies, many applications have become available that allow moving objects to be monitored and queried on the basis of their indoor locations. At the center of these ...
This paper addresses such problems and presents a novel indexing technique, Feature Based Adaptive Tolerance Tree (FATT), which is designed to bring an effective solution especially for indexing large databases. The proposed indexing scheme is then used along with a query by image content, in ...
Efficient indexing support is essential to allow content-based image and video databases using similarity-based retrieval to scale to large databases (tens... DA White,RC Jain - Electronic Imaging: Science & Technology 被引量: 426发表: 1996年 Snapshots in distributed storage systems Embodiments incl...
Multimediadatabases Cellmethods notgoodfordynamicstructure Quadtreeandk-dtree nottakepagingofsecondarymemoryintoaccount K-D-Btree usefulonlyforpointdata StructuresforHigh-dimensionaldata TheStructureofR-tree Aheight-balancedtreesimilartoaB+-tree; eachtuplehasauniqueidentifierwhichcanbeusedtoretrieveit ...
Direct spatial search on pictorial databases using packed R-trees In [FBF77] a NN algorithm for k-d-trees was proposed which was later refined in [Spro91]. R-trees [Gutt84], Packed R-trees =-=[Rous85]-=-, [Kamel93], R-tree variations [SRF87], [Beck90] have been primarily ...
the node level of the parent node having a threshold relative to one or more other node levels; andtraversing at most the number of child nodes nearest in distance to said at least one query descriptor as part of identifying a set of lowest level nodes indexing the subset of the set of ...
Yi Chen, et al., L-Tree: a Dynamic Labeling Structure for Ordered XML Data, Book Chapter: LNCS 3268—Current Trends in Database Technology, pp. 1-10, 2004, Springer-Verlag Berlin Heidelberg, Germany. Gongzhu Hu, et al., Indexing XML Data for Path Expression Queries, Book Chapter: LNCS...