2001 search results - page 31 / 401 » Indexing in a Hypertext Database |
ICDE
2003
IEEE
14 years 10 months ago
2003
IEEE
We present an index structure for managing weightedsequences in large databases. A weighted-sequence is defined as a two-dimensional structure where each element in the sequence i...
SSDBM
1998
IEEE
14 years 1 months ago
1998
IEEE
: A new issue that arises in modern applications involves the efficient manipulation of (static or moving) spatial objects, and the relationships among them. As a result, modern da...
ADC
2000
Springer
14 years 1 months ago
2000
Springer
While the B-tree (or the B+ -tree) is the most popular index structure in disk-based relational database systems, the Ttree has been widely accepted as a promising index structure...
SAC
2010
ACM
14 years 3 months ago
2010
ACM
Today’s Semantic Web datasets become increasingly larger containing up to several hundred million triples. The performance of index construction is a crucial factor for the succ...
DEXAW
2000
IEEE
14 years 1 months ago
2000
IEEE
Users of hypertext systems like the World Wide Web (WWW) often find themselves following hypertext links deeper and deeper, only to find themselves “lost” and unable to fin...