228 search results - page 7 / 46 » Relational queries over interpreted structures |
252
click to vote
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
133
click to vote
ICDT
1995
ACM
15 years 7 months ago
1995
ACM
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
251
Voted
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
147
click to vote
APLAS
2011
ACM
14 years 3 months ago
2011
ACM
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
135
click to vote
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
This paper proposes a ranking method to exploit statistical correlations among pairs of attribute values in relational databases. For a given query, the correlations of the query ...