Sciweavers

710 search results - page 25 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
ICDE
2003
IEEE
134views Database» more  ICDE 2003»
14 years 9 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...
COLING
2008
13 years 9 months ago
Underspecified Modelling of Complex Discourse Constraints
We introduce a new type of discourse constraints for the interaction of discourse relations with the configuration of discourse segments. We examine corpus-extracted examples as s...
Markus Egg, Michaela Regneri
ACL
2009
13 years 5 months ago
System for Querying Syntactically Annotated Corpora
This paper presents a system for querying treebanks. The system consists of a powerful query language with natural support for cross-layer queries, a client interface with a graph...
Petr Pajas, Jan Stepánek
CP
2000
Springer
13 years 11 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
VLDB
2003
ACM
147views Database» more  VLDB 2003»
14 years 8 months ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...