12,514 Hits in 6.8 sec

Refreshing Models to Provide Timely Query Recommendations

Daniele Broccolo, Franco Maria Nardini, Raffaele Perego, Fabrizio Silvestri
2010 Italian Information Retrieval Workshop  
We extend these algorithms to generate suggestions using: a static model (no updates), a model updated periodically, and a model continuously updating (i.e. each time a query is submitted).  ...  We assess the results by previously proposed evaluation metrics and we show that the use of periodical and continuous updates of the model used for recommending queries provides better recommendations.  ...  In the latest years, web search engines have started to provide users with query recommendations to help them in refining queries and to quickly satisfy their needs.  ... 
dblp:conf/iir/BroccoloNPS10 fatcat:2sktzhuimbhztfmiegadtldxz4

A GPU-specialized Inference Parameter Server for Large-Scale Deep Recommendation Models

Yingcan Wei, Matthias Langer, Fan Yu, Minseok Lee, Jie Liu, Ji Shi, Zehuan Wang
2022 Sixteenth ACM Conference on Recommender Systems  
To achieve peak prediction accuracy, modern recommendation models combine deep learning with terabytescale embedding tables to obtain a fine-grained representation of the underlying data.  ...  In this paper, we provide insights into the intriguing and challenging inference domain of online recommendation systems.  ...  To provide accurate predictions, state-of-the-art algorithms rely on embedding-based deep learning models. Figure 1 illustrates the typical architecture of a deep recommendation model (DLRM).  ... 
doi:10.1145/3523227.3546765 fatcat:z2edxnuqyfgg3ebatkk3pb7kju


Azarias Reda, Yubin Park, Mitul Tiwari, Christian Posse, Sam Shah
2012 Proceedings of the 21st ACM international conference on Information and knowledge management - CIKM '12  
Related search recommendation is one of several mechanisms used for improving members' search experience in finding relevant results to their queries.  ...  Third, we introduce a query length model for capturing bias in recommendation click behavior. We also discuss some of the practical concerns in deploying related search recommendations.  ...  More importantly, related search recommendations stay fresh for a relatively long period of time and can be refreshed rather infrequently.  ... 
doi:10.1145/2396761.2396847 dblp:conf/cikm/RedaPTPS12 fatcat:4nttbjperngi5dj46fjtivsswe

Automated Statistics Collection in DB2 UDB [chapter]

2004 Proceedings 2004 VLDB Conference  
changes in order to determine when to refresh the statistics values and when and how to adjust the set of statistics that the DBMS maintains.  ...  The use of inaccurate or outdated database statistics by the query optimizer in a relational DBMS often results in a poor choice of query execution plans and hence unacceptably long query processing times  ...  to unacceptably long query processing times.  ... 
doi:10.1016/b978-012088469-8/50100-5 fatcat:aj3m3oh6ujhithdw5f34d6xfju

Automated Statistics Collection in DB2 UDB [chapter]

A. Aboulnaga, P. Haas, M. Kandil, S. Lightstone, G. Lohman, V. Markl, I. Popivanov, V. Raman
2004 Proceedings 2004 VLDB Conference  
changes in order to determine when to refresh the statistics values and when and how to adjust the set of statistics that the DBMS maintains.  ...  The use of inaccurate or outdated database statistics by the query optimizer in a relational DBMS often results in a poor choice of query execution plans and hence unacceptably long query processing times  ...  to unacceptably long query processing times.  ... 
doi:10.1016/b978-012088469-8.50100-5 dblp:conf/vldb/AboulnagaHLLMPR04 fatcat:ykz6hmdpvzduzjxuhogtvd3fja

Multidimensional Database Design via Schema Transformation: Turning TPC-H into the TPC-H*d Multidimensional Benchmark

Alfredo Cuzzocrea, Rim Moussa
2013 International Conference on Management of Data  
We successfully used the framework to revolve the well known TPC-H benchmark to become a multidimensional benchmark -TPC-H*d benchmark, and translated into MDX language (MultiDimensional eXpressions) the  ...  In order to assess the effectiveness and the efficiency of our proposal, we benchmark the open source Mondrian ROLAP server and its OLAP4j driver with TPC-H*d benchmark.  ...  [11] propose a temporal extension of the multidimensional model inspired by temporal databases. The proposed model provides temporal support for levels, attributes, hierarchies, and measures.  ... 
dblp:conf/comad/CuzzocreaM13 fatcat:t6uijrlayrdf5ac3m3odcwid4i

Ajax-based report pages as incrementally rendered views

Yupeng Fu, Keith Kowalczykowski, Kian Win Ong, Yannis Papakonstantinou, Kevin Keliang Zhao
2010 Proceedings of the 2010 international conference on Management of data - SIGMOD '10  
The problem is exacerbated by distributed programming between the browser and server, where the developer uses JavaScript to access the page state and Java/SQL for the database.  ...  Such a declarative approach leads to significantly less code, as the framework automatically solves performance optimization problems that the developer would otherwise hand-code.  ...  Finally, the Program Director uses a Recommend Proposals page to peruse all reviews provided and indicate which proposals are recommended for funding.  ... 
doi:10.1145/1807167.1807229 dblp:conf/sigmod/FuKOPZ10 fatcat:o5apirwtbfgizjvhqa23znq3ia

Scalable Execution of Continuous Aggregation Queries over Web Data

Rajeev Gupta, Krithi Ramamritham
2012 IEEE Internet Computing  
Because these queries involve aggregation of dynamic data items, query results must be refreshed continuously to avoid the risk of the user seeing stale results.  ...  She uses Data delivered over the Internet is increasingly being used to provide dynamic and personalized user experiences.  ...  Using this data cost model, we can develop query cost models for various types of aggregation functions. 15 We can use these query cost models for query planning to minimize the number of refresh messages  ... 
doi:10.1109/mic.2012.13 fatcat:wwhvraq6yvepto3pykxb26n6i4

A Framework for Fairness in Two-Sided Marketplaces [article]

Kinjal Basu, Cyrus DiCiccio, Heloise Logan, Noureddine El Karoui
2020 arXiv   pre-print
Examples include search applications and recommender systems showing people, jobs, movies, products, restaurants, etc.  ...  The framework is flexible enough to adapt to different definitions of fairness and can be implemented in very large-scale settings. We perform simulations to show the efficacy of our approach.  ...  for the destination member d, who has been shown to members s t1 , ..., s tN from queries q t1 , ..., q tN at times t 1 , ..., t N prior to time T , the utility up to time T as U dest (d)[T ] = N i=1  ... 
arXiv:2006.12756v1 fatcat:q5cgkhfc6ve67mdzcgnnns5424

Robust Pseudo-Random Number Generators with Input Secure Against Side-Channel Attacks [chapter]

Michel Abdalla, Sonia Belaïd, David Pointcheval, Sylvain Ruhault, Damien Vergnaud
2015 Lecture Notes in Computer Science  
Here, we analyze this construction with respect to our new stronger security model, and prove that with a stronger G, it also resists leakage.  ...  In this paper, we extend the formal model of PRNG with input defined by Dodis et al. at CCS 2013 to deal with partial leakage of sensitive information.  ...  Between the i th uncompromised next-queries and the (i + 1) th uncompromised next-query, A can use its challenger to answer the queries asked by A, but providing the inputs for the refresh queries (with  ... 
doi:10.1007/978-3-319-28166-7_31 fatcat:udoqk7hhuja5fkzf3egtc3kzw4

OLAP Queries Context-Aware Recommender System [chapter]

Elsa Negre, Franck Ravat, Olivier Teste
2018 Lecture Notes in Computer Science  
In this paper, we provide (i) an indicator of obsolescence for OLAP queries and (ii) a context-aware recommender system based on a contextual post-filtering for OLAP queries.  ...  However some recommendations can be inappropriate (irrele-vant queries or non-computable queries). To overcome these mismatches, we propose to integrate contextual data into the recommender system.  ...  Given a user query q c and a set of past queries Ω that the recommender system kept, recommending queries aims to provide a subset Q R ⊆ Ω similar to q c .  ... 
doi:10.1007/978-3-319-98812-2_9 fatcat:i4bozhcpzzgf3lgkjhm77p3nuq

Vibes: A Platform-Centric Approach to Building Recommender Systems

Biswadeep Nag
2008 IEEE Data Engineering Bulletin  
The whole Vibes platform is designed to make it easy to extend and deploy new recommendation models (in most cases without having to write any custom code).  ...  Finally the serving infrastructure uses REST based web services APIs to provide quick and easy integration with other Yahoo! properties.  ...  Easy integration The customer should have to take minimum effort both to provide data that feeds into the modeling engine as well as to consume the recommendation outputs.  ... 
dblp:journals/debu/Nag08 fatcat:pbrns55inffu3dkkszfthujnve

Recommendation Projects at Yahoo!

Sihem Amer-Yahia
2011 IEEE Data Engineering Bulletin  
To evaluate the recommendation model for Trending Now, we use the model to predict ranking scores for all candidate queries at a certain time stamp of each event, and rank them in descending order.  ...  Introduction Recommendation is the task of providing content that is likely to interest users and enrich their online experience. At Yahoo!  ... 
dblp:journals/debu/Amer-Yahia11 fatcat:mq6spqwuzfeydlflohv547zaey

Database technology for decision support systems

S. Chaudhuri, U. Dayal, V. Ganti
2001 Computer  
Before building a system that provides this decision support information, FSC's analysts must address and resolve three fundamental issues: • what data to gather and how to conceptually model the data  ...  buy the new Walk-on-Air shoe model.  ...  Query response times are more important than transaction throughput.  ... 
doi:10.1109/2.970575 fatcat:2il3danygbhxnanzwt33kfnpie

Understanding failure response in service discovery systems

C. Dabrowski, K. Mills, S. Quirolgico
2007 Journal of Systems and Software  
Service discovery systems enable distributed components to find each other without prior arrangement, to express capabilities and needs, to aggregate into useful compositions, and to detect and adapt to  ...  This work contributes to better understanding of failure behavior in existing discovery systems, allowing potential users to configure deployments to obtain the best achievable robustness at the least  ...  SUs may query discovered SCMs for SDs of interest. Alternatively, a SU may deposit a query with the SCM, which will attempt to match SDs provided by SMs to specifications of the deposited query.  ... 
doi:10.1016/j.jss.2006.11.017 fatcat:pmjggefzrnhnjje33xu2ekqd2a
« Previous Showing results 1 — 15 out of 12,514 results