2001 search results - page 363 / 401 » Indexing in a Hypertext Database |
SEMWEB
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Increasing the number of peers in a peer-to-peer network usually increases the number of answers to a given query as well. While having more answers is nice in principle,...
VIZSEC
2004
Springer
14 years 1 months ago
2004
Springer
Most visualizations of security-related network data require large amounts of finely detailed, high-dimensional data. However, in some cases, the data available can only be coars...
CIKM
2003
Springer
14 years 27 days ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
CLOUD
2010
ACM
14 years 22 days ago
2010
ACM
Large-scale, user-facing applications are increasingly moving from relational databases to distributed key/value stores for high-request-rate, low-latency workloads. Often, this m...
SAINT
2002
IEEE
14 years 17 days ago
2002
IEEE
Almost conventional search engines employ centralized architecture. However, such an engine is not suitable for fresh information retrieval because it spends a long time to collec...