Skip to search formSkip to main contentSkip to account menu

X-tree

In computer science, an X-tree (for eXtended node tree) is an index tree structure based on the R-tree used for storing data in many dimensions. It… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Bounding volume hierarchyList of data structuresSpatial database

Broader (1)

R-tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
An Efficient 3D Ear Recognition System Based on Indexing
We propose a system for time-efficient 3D ear biometrics. The system is composed of two primary components, namely: (1) an ear… 
2013
2013
On-Demand Snapshot: An Efficient Versioning File System for Phase-Change Memory
Versioning file systems are widely used in modern computer systems as they provide system recovery and old data access functions… 
2011
2011
Clustering over Data Streams Based on Grid Density and Index Tree
2008
2008
A compact index structure with high data retrieval efficiency
The B+-tree and its variants have been reported as the good index structures for retrieving data. However, their index schemes… 
2007
2007
Reducing human interactions in Web directory searches
Consider a website containing a collection of webpages with data such as in Yahoo or the Open Directory project. Each page is… 
2006
2006
Approximation Techniques to Enable Dimensionality Reduction for Voronoi-Based Nearest Neighbor Search
Utilizing spatial index structures on secondary memory for nearest neighbor search in high-dimensional data spaces has been the… 
2003
2003
An Optimal Divide-Conquer Algorithm for 2D Skyline Queries
Skyline query processing is fundamental to many applications including multi-criteria decision making. In this paper, we will… 
2003
2003
Hotlink Enhancement Algorithms for Web Directories: (Extended Abstract)
Consider a web site containing a collection of web pages with data. Each page is associated with a weight representing the… 
Highly Cited
1999
Highly Cited
1999
Indexing techniques for wireless data broadcast under data clustering and scheduling
This paper investigates power conserving indexing techniques for data disseminated on a broadcast channel. A <italic>hybrid… 
1998
1998
Efficient Nearest-Neighbour Searches Using Weighted Euclidean Metric
Building an index tree is a common approach to speed up the k nearest neighbour search in large databases of many-dimensional… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)