261 search results - page 34 / 53 » An Optimization Technique for Answering Regular Path Queries |
135
click to vote
CONSTRAINTS
1998
14 years 11 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
108
click to vote
DKE
2006
14 years 11 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
114
Voted
ICDE
2010
IEEE
14 years 12 months ago
2010
IEEE
Abstract— Modern database management systems (DBMS) answer a multitude of complex queries on increasingly larger datasets. Given the complexities of the queries and the numerous ...
100
click to vote
KI
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Knowledge compilation is a common technique for propositional logic knowledge bases. The idea is to transform a given knowledge base into a special normal form ([MR03],[D...
ICDT
2010
ACM
15 years 9 months ago
2010
ACM
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...