2001 search results - page 352 / 401 » Indexing in a Hypertext Database |
VLDB
2004
ACM
14 years 1 months ago
2004
ACM
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
MMDB
2003
ACM
14 years 28 days ago
2003
ACM
Conventional approaches to image retrieval are based on the assumption that relevant images are physically near the query image in some feature space. This is the basis of the clu...
CIKM
2009
Springer
14 years 10 days ago
2009
Springer
The ability to deal with uncertain information is becoming increasingly important for modern database applications. Whereas a conventional (certain) object is usually represented ...
ICDE
2010
IEEE
14 years 20 hour ago
2010
IEEE
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
VLDB
1997
ACM
13 years 12 months ago
1997
ACM
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...