4616 search results - page 607 / 924 » Beyond relational databases |
183
Voted
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
210
click to vote
OTM
2009
Springer
16 years 1 months ago
2009
Springer
Collaboration in modeling is essential to success, but ORM diagrams intimidate many business people, and most would never install an ORM modeling tool on their computers. The Const...
143
click to vote
BTW
2003
Springer
15 years 12 months ago
2003
Springer
: In most commercial enterprises, information is scattered across a large number of (legacy) data stores. Moreover, it is nearly impossible to obtain funding to replace these data ...
165
click to vote
ICDT
1995
ACM
15 years 10 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...
315
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...