A tree structure used to search a database. When a branch point (node) is accessed, it is rotated or "splayed" to the root, changing the structure of the tree. Since pointers to the most frequently accessed records are always moved closer to the starting point of the search, those records are typically located faster. See quad tree.