432 search results - page 29 / 87 » On Notions of Regularity for Data Languages |
DOOD
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. Semistructured data has no absolute schema xed in advance and its structure may be irregular or incomplete. Such data commonly arises in sources that do not impose a rigi...
JMLR
2010
13 years 2 months ago
2010
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
APSEC
2002
IEEE
14 years 18 days ago
2002
IEEE
Many methods for XML processing have been proposed in the last few years. One popular approach is to process XML documents by using existing programming languages. Another popular...
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
ESOP
2008
Springer
13 years 9 months ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...