2121 search results - page 34 / 425 » Indexing Incomplete Databases |
SSDBM
1998
IEEE
14 years 2 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 2 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 5 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...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
BIBE
2003
IEEE
14 years 3 months ago
2003
IEEE
Hierarchical metric-space clustering methods have been commonly used to organize proteomes into taxonomies. Consequently, it is often anticipated that hierarchical clustering can ...