664 search results - page 19 / 133 » Generalized Search Trees for Database Systems |
110
click to vote
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document si...
118
click to vote
ANLP
1997
15 years 5 months ago
1997
A multilingual Internet-based employment advertisement system is described. Job ads are submitted as e-mailtexts, analysed by an example-based pattern matcher and stored in langua...
158
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
126
click to vote
WWW
2010
ACM
15 years 9 months ago
2010
ACM
Key-value stores (KVSs) are the most prevalent storage systems for large scale web services. As they do not have the structural complexities of RDBMSs, they are more efficient. In...
127
click to vote
IPM
2002
15 years 4 months ago
2002
The emergence of general audience digital libraries (GADLs) defines a context that represents a hybrid of both ``traditional'' IR, using primarily bibliographic resource...