6650 search results - page 169 / 1330 » Mutating database queries |
183
Voted
DAGSTUHL
2007
15 years 5 months ago
2007
Abstract Current, data-driven applications have become more dynamic in nature, with the need to respond to events generated from distributed sources or to react to information extr...
141
click to vote
CIKM
2010
Springer
15 years 2 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...
157
Voted
ICDCS
2009
IEEE
15 years 1 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 ...
147
Voted
SSDBM
2011
IEEE
14 years 7 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 ...
144
click to vote
SIGMOD
2000
ACM
15 years 8 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...