Sciweavers

813 search results - page 1 / 163
» Languages for Relational Databases over Interpreted Structur...
Sort
View
PODS
1997
ACM
124views Database» more  PODS 1997»
13 years 9 months ago
Languages for Relational Databases over Interpreted Structures
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...
Michael Benedikt, Leonid Libkin
JACM
2000
81views more  JACM 2000»
13 years 4 months ago
Relational queries over interpreted structures
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...
Michael Benedikt, Leonid Libkin
SIGMOD
2009
ACM
133views Database» more  SIGMOD 2009»
14 years 5 months ago
Hierarchical result views for keyword queries over relational databases
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...
Shiyuan Wang, Jun'ichi Tatemura, Arsany Sawires, O...
LICS
2002
IEEE
13 years 9 months ago
Monadic Queries over Tree-Structured Data
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...
Georg Gottlob, Christoph Koch
PODS
2010
ACM
213views Database» more  PODS 2010»
13 years 10 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...