DBRank '13Pub Date : 2013-08-30DOI: 10.1145/2524828.2524829
Christian S. Jensen
{"title":"Spatial keyword querying of geo-tagged web content","authors":"Christian S. Jensen","doi":"10.1145/2524828.2524829","DOIUrl":"https://doi.org/10.1145/2524828.2524829","url":null,"abstract":"The web is increasingly being used by mobile users, and it is increasingly possible to accurately geo-position mobile users. In addition, increasing volumes of geo-tagged web content are becoming available. Further, indications are that a substantial fraction of web keyword queries target local content. When combined, these observations suggest that spatial keyword querying is important and indeed gaining in importance. A prototypical spatial keyword query takes a user location and user-supplied keywords as parameters and returns web content that is spatially and textually relevant to these parameters. The paper reviews key concepts related to spatial keyword querying and reviews recent proposals by the author and his colleagues for spatial keyword querying functionality that is easy to use, relevant to users, and can be supported efficiently.","PeriodicalId":206590,"journal":{"name":"DBRank '13","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127098605","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
DBRank '13Pub Date : 2013-08-30DOI: 10.1145/2524828.2524835
B. Catania, G. Guerrini, A. Belussi, F. Mandreoli, R. Martoglia, W. Penzo
{"title":"Wearable queries: adapting common retrieval needs to data and users","authors":"B. Catania, G. Guerrini, A. Belussi, F. Mandreoli, R. Martoglia, W. Penzo","doi":"10.1145/2524828.2524835","DOIUrl":"https://doi.org/10.1145/2524828.2524835","url":null,"abstract":"The wealth of information generated by users interacting with the network and its applications is often under-utilized due to complications in accessing heterogeneous and dynamic data and in retrieving relevant information from sources having possibly unknown formats and structures. Processing complex requests on such information sources is, thus, costly, though not guaranteeing user satisfaction. Furthermore, dynamic contexts prevent substantial user involvement in the interpretation of requests.\u0000 The paper envisions an innovative solution to process the above mentioned requests, limiting user involvement by exploiting information on: (a) user context (geo-location, interests, needs); (b) data and processing quality; (c) similar requests repeated over time. By interpreting a request in a novel way by means of a Wearable Query (WQ), i.e., a query that captures the user and request specificities, we envision an approach to address repeated information needs in distributed, heterogeneous, dynamic environments, with emphasis on the geo-spatial dimension and on data quality.","PeriodicalId":206590,"journal":{"name":"DBRank '13","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121631194","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
DBRank '13Pub Date : 2013-08-30DOI: 10.1145/2524828.2524832
T. Roelleke, Marco Bonzanini, Miguel Martinez-Alvarez
{"title":"On the modelling of ranking algorithms in probabilistic datalog","authors":"T. Roelleke, Marco Bonzanini, Miguel Martinez-Alvarez","doi":"10.1145/2524828.2524832","DOIUrl":"https://doi.org/10.1145/2524828.2524832","url":null,"abstract":"TF-IDF, BM25, language modelling (LM), and divergence-from-randomness (DFR) are popular ranking models. Providing logical abstraction for information search is important, but the implementation of ranking algorithms in logical abstraction layers such as probabilistic Datalog leads to many challenges regarding expressiveness and scalability. Though the ranking algorithms have probabilistic roots, the ranking score often is not probabilistic, leading to unsafe programs from a probabilistic point of view. In this paper, we describe the evolution of probabilistic Datalog to provide concepts required for modelling ranking algorithms.","PeriodicalId":206590,"journal":{"name":"DBRank '13","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132374646","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
DBRank '13Pub Date : 2013-08-30DOI: 10.1145/2524828.2524830
Stelios Paparizos
{"title":"Entwining structure into web search","authors":"Stelios Paparizos","doi":"10.1145/2524828.2524830","DOIUrl":"https://doi.org/10.1145/2524828.2524830","url":null,"abstract":"Keyword based retrieval has dominated web search with its simplicity and effectiveness. However, given the abundance of structured and semi-structured data, there is an opportunity for an improved user experience. In this paper, we present an overview of our past work on analyzing keyword queries and extracting latent structured semantics, mapping them to corresponding data sources and enriching the user experience with the inclusion of structured content.","PeriodicalId":206590,"journal":{"name":"DBRank '13","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131112746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
DBRank '13Pub Date : 2013-08-30DOI: 10.1145/2524828.2524836
S. Bergamaschi, N. Ferro, F. Guerra, G. Silvello
{"title":"Keyword search and evaluation over relational databases: an outlook to the future","authors":"S. Bergamaschi, N. Ferro, F. Guerra, G. Silvello","doi":"10.1145/2524828.2524836","DOIUrl":"https://doi.org/10.1145/2524828.2524836","url":null,"abstract":"This position paper discusses the need for considering keyword search over relational databases in the light of broader systems, where keyword search is just one of the components and which are aimed at better supporting users in their search tasks. These more complex systems call for appropriate evaluation methodologies which go beyond what is typically done today, i.e. measuring performances of components mostly in isolation or not related to the actual user needs, and, instead, able to consider the system as a whole, its constituent components, and their inter-relations with the ultimate goal of supporting actual user search tasks.","PeriodicalId":206590,"journal":{"name":"DBRank '13","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115316477","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
DBRank '13Pub Date : 2013-08-30DOI: 10.1145/2524828.2524834
Yann Loyer, Isma Sadoun, K. Zeitouni
{"title":"Progressive ranking based on a dominance list","authors":"Yann Loyer, Isma Sadoun, K. Zeitouni","doi":"10.1145/2524828.2524834","DOIUrl":"https://doi.org/10.1145/2524828.2524834","url":null,"abstract":"Preference queries aim at increasing personalized pertinence of a selection. The most famous ones are the skyline queries based on the concept of dominance introduced by Pareto. Many other dominances have been proposed. In particular, many weaker forms of dominance aim at reducing the size of the answer of the skyline query. In most cases, applying just one dominance is not satisfying as it is hard to conciliate high pertinence, i.e. a strong dominance, and reasonable size of the selection. We propose to allow the user to decide what dominances are reliable, and what priorities between those dominances should be respected. This can be done by defining a sequence, eventually transfinite, of dominances. According to that sequence, we propose operators that compute progressively the ranking of a dataset by successive applications of the dominances without introducing inconsistencies. The principle of progressive refinement provides a great flexibility to the user that can not only dynamically decide to stop the process whenever the results satisfies his/her wishes, but can also navigates in the different levels of ranking and be aware of the level of reliability of each successive refinement.","PeriodicalId":206590,"journal":{"name":"DBRank '13","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127168362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
DBRank '13Pub Date : 2013-08-30DOI: 10.1145/2524828.2524831
F. Alvanaki, S. Michel
{"title":"A thin monitoring layer for top-k aggregation queries over a database","authors":"F. Alvanaki, S. Michel","doi":"10.1145/2524828.2524831","DOIUrl":"https://doi.org/10.1145/2524828.2524831","url":null,"abstract":"We consider the problem of maintaining a large set of top-k rankings over the update stream of a database. The rankings stem from top-k aggregation queries that are given a-priori based on the application scenario, for instance created along dimensions of a traditional data warehouse, for efficient automated reporting/detection of changes. The focus on only the top part of a ranking enables efficient buffering techniques to limit expensive interactions with the underlying database, while still guaranteeing correct top-k rankings at all times. This is achieved by employing conservative rank (score) estimates of previously unseen items that are not in the top-k result so far. The proposed family of maintenance algorithms further exploits the relations between the monitored rankings known from multi-query optimisation. We present results of a preliminary experimental evaluation using TPC-H data to study the performance of our algorithms.","PeriodicalId":206590,"journal":{"name":"DBRank '13","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128378374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
DBRank '13Pub Date : 2013-08-30DOI: 10.1145/2524828.2524833
Justin J. Levandoski
{"title":"Ranking and new database architectures","authors":"Justin J. Levandoski","doi":"10.1145/2524828.2524833","DOIUrl":"https://doi.org/10.1145/2524828.2524833","url":null,"abstract":"Database platform support for efficient ranking can have positive performance implications for a number of rank-aware applications, including data exploration, social network analysis, and keyword search. This talk highlights two pieces of work where ranking appears in the research area of database architectures for new hardware. First, we highlight the Bw-tree, a new high-performance B+-tree supporting sorted key-sequential access. The Bw-tree is re-architected to run efficiently on new hardware: its in-memory operations are completely latch-free, removing blocking behavior while also improving multi-core cache behavior, while its storage layer implements a novel log-structured flash storage layer for that exploits fast sequential writes and mitigates adverse performance impact of random writes. Second, we highlight a new classification technique for identifying âĂIJcoldâĂİ (infrequently accessed) data in main-memory database systems. Using a log of sampled record accesses, our technique estimates record access frequencies using exponential smoothing. This classification approach is very efficient: it is able to accurately identify hot and cold records among 1M records in sub-second time from a log of 1B record accesses on a workstation class machine.","PeriodicalId":206590,"journal":{"name":"DBRank '13","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134055287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
