Sciweavers

677 search results - page 64 / 136
» The XML Typechecking Problem
Sort
View
EDBT
2009
ACM
120views Database» more  EDBT 2009»
15 years 4 months ago
Retrieving meaningful relaxed tightest fragments for XML keyword search
Adapting keyword search to XML data has been attractive recently, generalized as XML keyword search (XKS). One of its key tasks is to return the meaningful fragments as the result...
Lingbo Kong, Rémi Gilleron, Aurélien...
EEE
2005
IEEE
15 years 3 months ago
A Web Registry for Publishing and Discovering Mathematical Services
This paper describes an extension of the ebXML registry for publishing and discovering mathematical service descriptions. The MathBroker registry is able to handle descriptions gi...
Rebhi Baraka, Olga Caprotti, Wolfgang Schreiner
IS
2010
14 years 8 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
77
Voted
VLDB
1999
ACM
87views Database» more  VLDB 1999»
15 years 2 months ago
Query Optimization for XML
XML is an emerging standard for data representation and exchange on the World-Wide Web. Due to the nature of information on the Web and the inherent flexibility of XML, we expect...
Jason McHugh, Jennifer Widom
LICS
2010
IEEE
14 years 8 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...