710 search results - page 10 / 142 » Relational Expressive Power of Constraint Query Languages |
ECCB
2005
IEEE
14 years 1 months ago
2005
IEEE
Many areas of modern biology are concerned with the management, storage, visualization, comparison, and analysis of networks. For instance, networks are used to model signal trans...
SSDBM
1998
IEEE
13 years 12 months ago
1998
IEEE
A relation is an unordered collection of records. Often, however, there is an underlying order (e.g., a sequence of stock prices), and users want to pose queries that reflect this...
LICS
2005
IEEE
14 years 1 months ago
2005
IEEE
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...
TAL
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. We define Probabilistic Constrained W-grammars (PCWgrammars), a two-level formalism capable of capturing grammatical frameworks used in two state of the art parsers, nam...
SDB
1995
13 years 11 months ago
1995
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...