Sciweavers

85 search results - page 11 / 17
» Efficient Data Representation in Polymorphic Languages
Sort
View
ICDE
2003
IEEE
134views Database» more  ICDE 2003»
15 years 11 months ago
Propagating XML Constraints to Relations
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...
Susan B. Davidson, Wenfei Fan, Carmem S. Hara, Jin...
NJC
2006
102views more  NJC 2006»
14 years 9 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
77
Voted
VLDB
2002
ACM
131views Database» more  VLDB 2002»
14 years 9 months ago
ProTDB: Probabilistic Data in XML
Whereas traditional databases manage only deterministic information, many applications that use databases involve uncertain data. This paper presents a Probabilistic Tree Data Bas...
Andrew Nierman, H. V. Jagadish
ICGI
2010
Springer
14 years 7 months ago
Learning Context Free Grammars with the Syntactic Concept Lattice
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
Alexander Clark
WSC
2008
14 years 12 months ago
Representing layout information in the CMSD specification
Developing mechanisms for the efficient exchange of information between simulations and other manufacturing tools is a critical problem. For many areas of manufacturing, neither r...
Frank Riddick, Y. Tina Lee