274 search results - page 34 / 55 » Computational complexity of queries based on itemsets |
147
click to vote
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
93
Voted
AAAI
1997
15 years 1 months ago
1997
This paper describes an environment for supporting very large ontologies. The system can be used on single PCs, workstations, a cluster of workstations, and high-end parallel supe...
193
click to vote
SIGMOD
2008
ACM
16 years 18 days ago
2008
ACM
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
124
Voted
ICDT
2010
ACM
15 years 9 months ago
2010
ACM
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
116
click to vote
MIDDLEWARE
2004
Springer
15 years 5 months ago
2004
Springer
Application servers provide many functionalities commonly needed in the development of a complex distributed application. So far, the functionalities have mostly been developed an...