496 search results - page 95 / 100 » Efficient Implementation of Semantic Relations in Lexical Da... |
VLDB
1995
ACM
13 years 11 months ago
1995
ACM
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
Given that commercial search engines cover billions of web pages, efficiently managing the corresponding volumes of disk-resident data needed to answer user queries quickly is a f...
ICDE
2010
IEEE
14 years 16 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...
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
DLOG
2004
13 years 9 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...