Found: 6
Select item for more details and to access through your institution.
Stream sampling over windows with worst-case optimality and $$\ell $$ -overlap independence.
- Published in:
- VLDB Journal International Journal on Very Large Data Bases, 2017, v. 26, n. 4, p. 493, doi. 10.1007/s00778-017-0461-x
- By:
- Publication type:
- Article
Argument discovery via crowdsourcing.
- Published in:
- VLDB Journal International Journal on Very Large Data Bases, 2017, v. 26, n. 4, p. 511, doi. 10.1007/s00778-017-0462-9
- By:
- Publication type:
- Article
Efficiently making (almost) any concurrency control mechanism serializable.
- Published in:
- VLDB Journal International Journal on Very Large Data Bases, 2017, v. 26, n. 4, p. 537, doi. 10.1007/s00778-017-0463-8
- By:
- Publication type:
- Article
I/O-efficient algorithms for top- k nearest keyword search in massive graphs.
- Published in:
- VLDB Journal International Journal on Very Large Data Bases, 2017, v. 26, n. 4, p. 563, doi. 10.1007/s00778-017-0464-7
- By:
- Publication type:
- Article
Indexing metric uncertain data for range queries and range joins.
- Published in:
- VLDB Journal International Journal on Very Large Data Bases, 2017, v. 26, n. 4, p. 585, doi. 10.1007/s00778-017-0465-6
- By:
- Publication type:
- Article
On efficiently finding reverse k-nearest neighbors over uncertain graphs.
- Published in:
- VLDB Journal International Journal on Very Large Data Bases, 2017, v. 26, n. 4, p. 467, doi. 10.1007/s00778-017-0460-y
- By:
- Publication type:
- Article