228 search results - page 40 / 46 » Relational queries over interpreted structures |
136
click to vote
ICDM
2006
IEEE
15 years 5 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
Web textual advertising can be interpreted as a search problem over the corpus of ads available for display in a particular context. In contrast to conventional information retrie...
104
click to vote
JAR
2006
14 years 11 months ago
2006
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
173
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
XML database systems are expected to handle increasingly complex queries over increasingly large and highly structured XML databases. An important problem that needs to be solved ...
SIGSOFT
2009
ACM
16 years 13 days ago
2009
ACM
In large software development projects, when a programmer is assigned a bug to fix, she typically spends a lot of time searching (in an ad-hoc manner) for instances from the past ...