835 search results - page 94 / 167 » Structural Recursion as a Query Language |
DL
1994
Springer
14 years 1 months ago
1994
Springer
Digital Libraries will hold huge amounts of text and other forms of information. For the collections to be maximally useful, they must be highly organized with useful indexes and ...
ACL
2007
13 years 10 months ago
2007
A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements are significantly below lossless information-theoretic lower bounds but it ...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
Many data integration solutions in the market today include tools for schema mapping, to help users visually relate elements of different schemas. Schema elements are connected wit...
VLDB
1994
ACM
14 years 1 months ago
1994
ACM
Physical data independence is touted as a central feature of modern database systems. Both relational and object-oriented systems, however, force users to frame their queries in t...
IR
2008
13 years 9 months ago
2008
We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query wo...