Sciweavers

90 search results - page 2 / 18
» Union Types for Semistructured Data
Sort
View
ICDT
2001
ACM
189views Database» more  ICDT 2001»
13 years 9 months ago
A Semi-monad for Semi-structured Data
This document proposes an algebra for XML Query. The algebra has been submitted to the W3C XML Query Working Group. A novel feature of the algebra is the use of regular-expression ...
Mary F. Fernández, Jérôme Sim&...
SIGMOD
1998
ACM
150views Database» more  SIGMOD 1998»
13 years 9 months ago
Extracting Schema from Semistructured Data
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
Svetlozar Nestorov, Serge Abiteboul, Rajeev Motwan...
IEICET
2008
67views more  IEICET 2008»
13 years 5 months ago
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
Satoshi Matsumoto, Takayoshi Shoudai, Tomoyuki Uch...
VLDB
1998
ACM
149views Database» more  VLDB 1998»
13 years 9 months ago
Incremental Maintenance for Materialized Views over Semistructured Data
Semistructured data is not strictly typed like relational or object-oriented data and may be irregular or incomplete. It often arises in practice, e.g., when heterogeneous data so...
Serge Abiteboul, Jason McHugh, Michael Rys, Vasili...
ISMIS
2003
Springer
13 years 10 months ago
NETMARK: A Schema-Less Extension for Relational Databases for Managing Semi-structured Data Dynamically
Object-Relational database management system is an integrated hybrid cooperative approach to combine the best practices of both the relational model utilizing SQL queries and the ...
David A. Maluf, Peter B. Tran