87 search results - page 7 / 18 » Completeness Estimation of Range Queries in Structured Overl... |
158
click to vote
ICDE
2006
IEEE
15 years 10 months ago
2006
IEEE
We propose XSEED, a synopsis of path queries for cardinality estimation that is accurate, robust, efficient, and adaptive to memory budgets. XSEED starts from a very small kernel,...
P2P
2009
IEEE
15 years 4 months ago
2009
IEEE
The enormous interest for peer-to-peer systems in recent years has prompted research into finding scalable and robust seeding and searching methods to support these overlay netwo...
134
click to vote
COMPGEOM
2011
ACM
14 years 1 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
BIS
2008
14 years 11 months ago
2008
Abstract. A common task in business process modelling is the verification of process models regarding syntactical and structural errors. While the former might be checked with low ...
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...