7576 search results - page 260 / 1516 » On Querying Ontologies and Databases |
193
Voted
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
198
click to vote
ICDCS
2009
IEEE
15 years 4 months ago
2009
IEEE
The balance between privacy and utility is a classical problem with an increasing impact on the design of modern information systems. On the one side it is crucial to ensure that ...
197
click to vote
SSDBM
2011
IEEE
14 years 10 months ago
2011
IEEE
Large-scale N-body simulations play an important role in advancing our understanding of the formation and evolution of large structures in the universe. These computations require ...
198
click to vote
SIGMOD
2000
ACM
15 years 11 months ago
2000
ACM
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
189
click to vote
CIKM
1993
Springer
15 years 10 months ago
1993
Springer
We present a new interface for Object-Oriented Database Management Systems (OODBMSs). The GOODIES1 system combines and expands the functions of many existing interface systems, in...