📄 http:^^gist.cs.berkeley.edu:8000^gist^gistabs.html
字号:
Date: Tue, 14 Jan 1997 23:38:39 GMT
Server: NCSA/1.5.2
Last-modified: Mon, 05 Aug 1996 19:39:49 GMT
Content-type: text/html
Content-length: 1276
<HTML><HEAD><TITLE>Generalized Search Trees for Database Systems</TITLE></HEAD><BODY><STRONG>Abstract.</STRONG> This paper introduces the Generalized Search Tree (GiST), anindex structure supporting an extensible set of queries and datatypes. The GiST allows new data types to be indexed in a mannersupporting queries natural to the types; this is in contrast toprevious work on tree extensibility which only supported thetraditional set of equality and range predicates. In a single datastructure, the GiST provides all the basic search tree logic requiredby a database system, thereby unifying disparate structures such asB+-trees and R-trees in a single piece of code, and opening theapplication of search trees to general extensibility.<p> To illustrate the flexibility of the GiST, we provide simplemethod implementations that allow it to behave like a B+-tree, anR-tree, and an <EM>RD-tree</EM>, a new index for data with set-valuedattributes. We also present a preliminary performance analysis ofRD-trees, which leads to discussion on the nature of tree indices andhow they behave for various datasets.<HR> Last modified: Fri May 5 12:34:10 1995 by Joe Hellerstein<!WA0><A HREF="http://GiST.CS.Berkeley.EDU:8000/~jmh/index.html">jmh@cs.berkeley.edu</A></ADDRESS></BODY></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -