185 search results - page 14 / 37 » Precise complexity analysis for efficient datalog queries |
95
Voted
EDBT
2010
ACM
15 years 2 months ago
2010
ACM
The creation of a generic and modular query optimization and processing infrastructure can provide significant benefits to XML data management. Key pieces of such an infrastructur...
95
Voted
COMGEO
2010
ACM
14 years 9 months ago
2010
ACM
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...
104
click to vote
DBISP2P
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. This paper addresses the problem of data placement, indexing, and querying large XML data repositories distributed over an existing P2P service infrastructure. Our archit...
183
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
170
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {...