806 search results - page 27 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
ICALP
2010
Springer
14 years 13 days ago
2010
Springer
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
The ability to provide accurate and efficient result estimations of user queries is very important for the query optimizer in database systems. In this paper, we show that the tra...
ICDE
2001
IEEE
14 years 9 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
ICDT
1997
ACM
13 years 11 months ago
1997
ACM
We develop a new schema for unstructured data. Traditional schemas resemble the type systems of programming languages. For unstructured data, however, the underlying type may be mu...
SIAMCOMP
1998
13 years 7 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...