Sciweavers

185 search results - page 14 / 37
» Precise complexity analysis for efficient datalog queries
Sort
View
95
Voted
EDBT
2010
ACM
189views Database» more  EDBT 2010»
15 years 2 months ago
Efficient physical operators for cost-based XPath execution
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...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
95
Voted
COMGEO
2010
ACM
14 years 9 months ago
An efficient algorithm for the stratification and triangulation of an algebraic surface
: 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...
Eric Berberich, Michael Kerber, Michael Sagraloff
DBISP2P
2006
Springer
195views Database» more  DBISP2P 2006»
15 years 1 months ago
XML Query Routing in Structured P2P Systems
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...
Leonidas Fegaras, Weimin He, Gautam Das, David Lev...
SIGMOD
2008
ACM
162views Database» more  SIGMOD 2008»
15 years 9 months ago
Event queries on correlated probabilistic streams
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 ...
Christopher Ré, Dan Suciu, Julie Letchner, ...
ICDE
2009
IEEE
180views Database» more  ICDE 2009»
15 years 11 months ago
Reverse Furthest Neighbors in Spatial Databases
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 {...
Bin Yao, Feifei Li, Piyush Kumar