ACM Home Page
Please provide us with feedback. Feedback
OLAP on search logs: an infrastructure supporting data-driven applications in search engines
Full text PdfPdf (842 KB)
Source
International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Paris, France
SESSION: Industrial track papers table of contents
Pages 1395-1404  
Year of Publication: 2009
ISBN:978-1-60558-495-9
Authors
Bin Zhou  Simon Fraser University, Burnaby, BC, Canada
Daxin Jiang  Microsoft Research Asia, Beijing, China
Jian Pei  Simon Fraser University, Burnaby, BC, Canada
Hang Li  Microsoft Research Asia, Beijing, China
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 88,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1557019.1557168
What is a DOI?

ABSTRACT

Search logs, which contain rich and up-to-date information about users' needs and preferences, have become a critical data source for search engines. Recently, more and more data-driven applications are being developed in search engines based on search logs, such as query suggestion, keyword bidding, and dissatisfactory query analysis. In this paper, by observing that many data-driven applications in search engines highly rely on online mining of search logs, we develop an OLAP system on search logs which serves as an infrastructure supporting various data-driven applications. An empirical study using real data of over two billion query sessions demonstrates the usefulness and feasibility of our design.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
4
 
5
6
7
8
9
 
10
R. Giegerich and S. Kurtz. From ukkonen to mccreight and weiner: A unifying view of linear time suffix tree construction. Algorithmica, 19:331--353, 1997.
 
11
 
12
13
14
 
15
16
17
18
19
 
20
21
22
23

Collaborative Colleagues:
Bin Zhou: colleagues
Daxin Jiang: colleagues
Jian Pei: colleagues
Hang Li: colleagues