861 search results - page 91 / 173 » Relational Completeness of Query Languages for Annotated Dat... |
CNL
2009
14 years 11 months ago
2009
Abstract. As it is well-known, querying and managing structured data in natural language is a challenging task due to its ambiguity (syntactic and semantic) and its expressiveness....
IDEAS
2002
IEEE
15 years 2 months ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
AMW
2009
14 years 7 months ago
2009
We address schema design in uncertain databases. Since uncertain data is relational in nature, decomposition becomes a key issue in design. Decomposition relies on dependency theo...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Search engines that support structured documents typically support structure created by the author (e.g., title, section), and may also support structure added by an annotation pr...
ICDT
2003
ACM
15 years 3 months ago
2003
ACM
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...