228 search results - page 1 / 46 » Relational queries over interpreted structures |
JACM
2000
13 years 5 months ago
2000
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
PODS
1997
ACM
13 years 9 months ago
1997
ACM
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Enabling keyword queries over relational databases (KQDB) benefits a large population of users who have difficulty in understanding the database schema or using SQLs. However, sin...
SIGIR
2010
ACM
13 years 3 months ago
2010
ACM
Keyword queries over structured databases are notoriously ambiguous. No single interpretation of a keyword query can satisfy all users, and multiple interpretations may yield over...
LICS
2002
IEEE
13 years 10 months ago
2002
IEEE
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...