<> <http://www.w3.org/2000/01/rdf-schema#comment> "The repository administrator has not yet configured an RDF license."^^<http://www.w3.org/2001/XMLSchema#string> .
<> <http://xmlns.com/foaf/0.1/primaryTopic> <https://discovery.ucl.ac.uk/id/eprint/10152071> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/AcademicArticle> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Article> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://purl.org/dc/terms/title> "Approximate query processing over static sets and sliding windows☆"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://purl.org/ontology/bibo/abstract> "Indexing of static and dynamic sets is fundamental to a large set of applications such as information retrieval and caching. Denoting the characteristic vector of the set by B, we consider the problem of encoding sets and multisets to support approximate versions of the operations  (i.e., computing ) and  (i.e., finding ) queries. We study multiple types of approximations (allowing an error in the query or the result) and present lower bounds and succinct data structures for several variants of the problem. We also extend our model to sliding windows, in which we process a stream of elements and compute suffix sums. This is a generalization of the window summation problem that allows the user to specify the window size at query time. Here, we provide an algorithm that supports updates and queries in constant time while requiring just  factor more space than the fixed-window summation algorithms."^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://purl.org/dc/terms/date> "2021-09-11" .
<https://discovery.ucl.ac.uk/id/document/1474545> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Document> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://purl.org/ontology/bibo/volume> "885" .
<https://discovery.ucl.ac.uk/id/org/ext-f308aad1ef8f70546c3a197f104f2ad5> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Organization> .
<https://discovery.ucl.ac.uk/id/org/ext-f308aad1ef8f70546c3a197f104f2ad5> <http://xmlns.com/foaf/0.1/name> "Elsevier"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://purl.org/dc/terms/publisher> <https://discovery.ucl.ac.uk/id/org/ext-f308aad1ef8f70546c3a197f104f2ad5> .
<https://discovery.ucl.ac.uk/id/publication/ext-e95f958254570e041c3dbe7d76f4d559> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Collection> .
<https://discovery.ucl.ac.uk/id/publication/ext-e95f958254570e041c3dbe7d76f4d559> <http://xmlns.com/foaf/0.1/name> "Theoretical Computer Science"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://purl.org/dc/terms/isPartOf> <https://discovery.ucl.ac.uk/id/publication/ext-e95f958254570e041c3dbe7d76f4d559> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://purl.org/ontology/bibo/status> <http://purl.org/ontology/bibo/status/published> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-5a371d39e4af97a4cde83ca950688f87> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/10152071#authors> .
<https://discovery.ucl.ac.uk/id/eprint/10152071#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_1> <https://discovery.ucl.ac.uk/id/person/ext-5a371d39e4af97a4cde83ca950688f87> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-0bc856d315f486ec09662cfd7d09594b> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/10152071#authors> .
<https://discovery.ucl.ac.uk/id/eprint/10152071#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_2> <https://discovery.ucl.ac.uk/id/person/ext-0bc856d315f486ec09662cfd7d09594b> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-0e2dd13dee5e41bde866ef5c0a0b2322> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/10152071#authors> .
<https://discovery.ucl.ac.uk/id/eprint/10152071#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_3> <https://discovery.ucl.ac.uk/id/person/ext-0e2dd13dee5e41bde866ef5c0a0b2322> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-bba961df39b4b1550fa84ccc9ac4349e> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/10152071#authors> .
<https://discovery.ucl.ac.uk/id/eprint/10152071#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_4> <https://discovery.ucl.ac.uk/id/person/ext-bba961df39b4b1550fa84ccc9ac4349e> .
<https://discovery.ucl.ac.uk/id/person/ext-0e2dd13dee5e41bde866ef5c0a0b2322> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-0e2dd13dee5e41bde866ef5c0a0b2322> <http://xmlns.com/foaf/0.1/givenName> "Srinivasa Rao"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-0e2dd13dee5e41bde866ef5c0a0b2322> <http://xmlns.com/foaf/0.1/familyName> "Satti"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-0e2dd13dee5e41bde866ef5c0a0b2322> <http://xmlns.com/foaf/0.1/name> "Srinivasa Rao Satti"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-bba961df39b4b1550fa84ccc9ac4349e> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-bba961df39b4b1550fa84ccc9ac4349e> <http://xmlns.com/foaf/0.1/givenName> "Shubham"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-bba961df39b4b1550fa84ccc9ac4349e> <http://xmlns.com/foaf/0.1/familyName> "Ugare"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-bba961df39b4b1550fa84ccc9ac4349e> <http://xmlns.com/foaf/0.1/name> "Shubham Ugare"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-0bc856d315f486ec09662cfd7d09594b> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-0bc856d315f486ec09662cfd7d09594b> <http://xmlns.com/foaf/0.1/givenName> "Seungbum"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-0bc856d315f486ec09662cfd7d09594b> <http://xmlns.com/foaf/0.1/familyName> "Jo"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-0bc856d315f486ec09662cfd7d09594b> <http://xmlns.com/foaf/0.1/name> "Seungbum Jo"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-5a371d39e4af97a4cde83ca950688f87> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-5a371d39e4af97a4cde83ca950688f87> <http://xmlns.com/foaf/0.1/givenName> "Ran Ben"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-5a371d39e4af97a4cde83ca950688f87> <http://xmlns.com/foaf/0.1/familyName> "Basat"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-5a371d39e4af97a4cde83ca950688f87> <http://xmlns.com/foaf/0.1/name> "Ran Ben Basat"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/EPrint> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/ArticleEPrint> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://purl.org/dc/terms/isPartOf> <https://discovery.ucl.ac.uk/id/repository> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/1474545> .
<https://discovery.ucl.ac.uk/id/document/1474545> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/1474545> <http://www.w3.org/2000/01/rdf-schema#label> "Approximate query processing over static sets and sliding windows☆ (PDF)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://purl.org/dc/elements/1.1/hasVersion> <https://discovery.ucl.ac.uk/id/document/1474545> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://eprints.org/ontology/hasPublished> <https://discovery.ucl.ac.uk/id/document/1474545> .
<https://discovery.ucl.ac.uk/id/document/1474545> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/10152071/1/1-s2.0-S0304397521003571-main.pdf> .
<https://discovery.ucl.ac.uk/id/document/1474545> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/10152071/1/1-s2.0-S0304397521003571-main.pdf> .
<https://discovery.ucl.ac.uk/id/eprint/10152071/1/1-s2.0-S0304397521003571-main.pdf> <http://www.w3.org/2000/01/rdf-schema#label> "1-s2.0-S0304397521003571-main.pdf"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/1477456> .
<https://discovery.ucl.ac.uk/id/document/1477456> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/1477456> <http://www.w3.org/2000/01/rdf-schema#label> "Approximate query processing over static sets and sliding windows☆ (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/1477456> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/1474545> .
<https://discovery.ucl.ac.uk/id/document/1477456> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/1474545> .
<https://discovery.ucl.ac.uk/id/document/1477456> <http://eprints.org/relation/isIndexCodesVersionOf> <https://discovery.ucl.ac.uk/id/document/1474545> .
<https://discovery.ucl.ac.uk/id/document/1477456> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/10152071/2/indexcodes.txt> .
<https://discovery.ucl.ac.uk/id/document/1477456> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/10152071/2/indexcodes.txt> .
<https://discovery.ucl.ac.uk/id/eprint/10152071/2/indexcodes.txt> <http://www.w3.org/2000/01/rdf-schema#label> "indexcodes.txt"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/1477457> .
<https://discovery.ucl.ac.uk/id/document/1477457> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/1477457> <http://www.w3.org/2000/01/rdf-schema#label> "Approximate query processing over static sets and sliding windows☆ (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/1477457> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/1474545> .
<https://discovery.ucl.ac.uk/id/document/1477457> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/1474545> .
<https://discovery.ucl.ac.uk/id/document/1477457> <http://eprints.org/relation/islightboxThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/1474545> .
<https://discovery.ucl.ac.uk/id/document/1477457> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/10152071/3/lightbox.jpg> .
<https://discovery.ucl.ac.uk/id/document/1477457> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/10152071/3/lightbox.jpg> .
<https://discovery.ucl.ac.uk/id/eprint/10152071/3/lightbox.jpg> <http://www.w3.org/2000/01/rdf-schema#label> "lightbox.jpg"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/1477458> .
<https://discovery.ucl.ac.uk/id/document/1477458> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/1477458> <http://www.w3.org/2000/01/rdf-schema#label> "Approximate query processing over static sets and sliding windows☆ (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/1477458> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/1474545> .
<https://discovery.ucl.ac.uk/id/document/1477458> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/1474545> .
<https://discovery.ucl.ac.uk/id/document/1477458> <http://eprints.org/relation/ispreviewThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/1474545> .
<https://discovery.ucl.ac.uk/id/document/1477458> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/10152071/4/preview.jpg> .
<https://discovery.ucl.ac.uk/id/document/1477458> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/10152071/4/preview.jpg> .
<https://discovery.ucl.ac.uk/id/eprint/10152071/4/preview.jpg> <http://www.w3.org/2000/01/rdf-schema#label> "preview.jpg"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/1477459> .
<https://discovery.ucl.ac.uk/id/document/1477459> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/1477459> <http://www.w3.org/2000/01/rdf-schema#label> "Approximate query processing over static sets and sliding windows☆ (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/1477459> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/1474545> .
<https://discovery.ucl.ac.uk/id/document/1477459> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/1474545> .
<https://discovery.ucl.ac.uk/id/document/1477459> <http://eprints.org/relation/ismediumThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/1474545> .
<https://discovery.ucl.ac.uk/id/document/1477459> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/10152071/5/medium.jpg> .
<https://discovery.ucl.ac.uk/id/document/1477459> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/10152071/5/medium.jpg> .
<https://discovery.ucl.ac.uk/id/eprint/10152071/5/medium.jpg> <http://www.w3.org/2000/01/rdf-schema#label> "medium.jpg"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/1477460> .
<https://discovery.ucl.ac.uk/id/document/1477460> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/1477460> <http://www.w3.org/2000/01/rdf-schema#label> "Approximate query processing over static sets and sliding windows☆ (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/1477460> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/1474545> .
<https://discovery.ucl.ac.uk/id/document/1477460> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/1474545> .
<https://discovery.ucl.ac.uk/id/document/1477460> <http://eprints.org/relation/issmallThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/1474545> .
<https://discovery.ucl.ac.uk/id/document/1477460> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/10152071/6/small.jpg> .
<https://discovery.ucl.ac.uk/id/document/1477460> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/10152071/6/small.jpg> .
<https://discovery.ucl.ac.uk/id/eprint/10152071/6/small.jpg> <http://www.w3.org/2000/01/rdf-schema#label> "small.jpg"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10152071> <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://discovery.ucl.ac.uk/id/eprint/10152071/> .
<https://discovery.ucl.ac.uk/id/eprint/10152071/> <http://purl.org/dc/elements/1.1/title> "HTML Summary of #10152071 \n\nApproximate query processing over static sets and sliding windows☆\n\n" .
<https://discovery.ucl.ac.uk/id/eprint/10152071/> <http://purl.org/dc/elements/1.1/format> "text/html" .
<https://discovery.ucl.ac.uk/id/eprint/10152071/> <http://xmlns.com/foaf/0.1/primaryTopic> <https://discovery.ucl.ac.uk/id/eprint/10152071> .