File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1145/2505515.2505759
- Scopus: eid_2-s2.0-84889575925
- WOS: WOS:000722225900279
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: Context-aware Top-k Processing Using Views
Title | Context-aware Top-k Processing Using Views |
---|---|
Authors | |
Keywords | Context-aware applications Social search Spatial search Top-k processing |
Issue Date | 2013 |
Publisher | ACM Press. |
Citation | Proceedings of the 22nd ACM International Conference on Information and Knowledge Management (CIKM), San Francisco, USA, 27 October-1 November 2013, p. 1959-1968 How to Cite? |
Abstract | Search applications where queries are dependent on their context are becoming increasingly relevant in today's online applications. For example, the context may be the location of the user in location- aware search or the social network of the query initiator in social-aware search. Processing such queries efficiently is inherently difficult, and requires techniques that go beyond the existing, context-agnostic ones. A promising direction for efficient, online answering -- especially in the case of top-k queries -- is to materialize and exploit previous query results (views).
We consider context-aware query optimization based on views, focusing on two important sub-problems. First, handling the possible differences in context between the various views and an input query leads to view results having uncertain scores, i.e., score ranges valid for the new context. As a consequence, current top-k algorithms are no longer directly applicable and need to be adapted to handle such uncertainty in object scores. Second, adapted view selection techniques are needed, which can leverage both the descriptions of queries and statistics over their results. We present algorithms that address these two problems, and illustrate their practical use in two important application scenarios: location-aware search and social-aware search. We validate our approaches via extensive experiments, using both synthetic and real-world datasets. |
Persistent Identifier | http://hdl.handle.net/10722/201104 |
ISBN | |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Maniu, S | en_US |
dc.contributor.author | Cautis, B | en_US |
dc.date.accessioned | 2014-08-21T07:13:34Z | - |
dc.date.available | 2014-08-21T07:13:34Z | - |
dc.date.issued | 2013 | en_US |
dc.identifier.citation | Proceedings of the 22nd ACM International Conference on Information and Knowledge Management (CIKM), San Francisco, USA, 27 October-1 November 2013, p. 1959-1968 | en_US |
dc.identifier.isbn | 9781450322638 | - |
dc.identifier.uri | http://hdl.handle.net/10722/201104 | - |
dc.description.abstract | Search applications where queries are dependent on their context are becoming increasingly relevant in today's online applications. For example, the context may be the location of the user in location- aware search or the social network of the query initiator in social-aware search. Processing such queries efficiently is inherently difficult, and requires techniques that go beyond the existing, context-agnostic ones. A promising direction for efficient, online answering -- especially in the case of top-k queries -- is to materialize and exploit previous query results (views). We consider context-aware query optimization based on views, focusing on two important sub-problems. First, handling the possible differences in context between the various views and an input query leads to view results having uncertain scores, i.e., score ranges valid for the new context. As a consequence, current top-k algorithms are no longer directly applicable and need to be adapted to handle such uncertainty in object scores. Second, adapted view selection techniques are needed, which can leverage both the descriptions of queries and statistics over their results. We present algorithms that address these two problems, and illustrate their practical use in two important application scenarios: location-aware search and social-aware search. We validate our approaches via extensive experiments, using both synthetic and real-world datasets. | - |
dc.language | eng | en_US |
dc.publisher | ACM Press. | en_US |
dc.relation.ispartof | ACM International Conference on Information and Knowledge Management | en_US |
dc.subject | Context-aware applications | - |
dc.subject | Social search | - |
dc.subject | Spatial search | - |
dc.subject | Top-k processing | - |
dc.title | Context-aware Top-k Processing Using Views | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Maniu, S: smaniu@cs.hku.hk | en_US |
dc.identifier.doi | 10.1145/2505515.2505759 | - |
dc.identifier.scopus | eid_2-s2.0-84889575925 | - |
dc.identifier.hkuros | 232982 | en_US |
dc.identifier.spage | 1959 | - |
dc.identifier.epage | 1968 | - |
dc.identifier.isi | WOS:000722225900279 | - |
dc.publisher.place | New York, N.Y. | - |