Answering bounded continuous search queries in the world wide web

Kukulenz, Dirk; Ntoulas, Alexandros

doi:10.1145/1242572.1242647

Cited by 15 publications

(19 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They address the issue of poor initial performance during online training by applying a fixed policy to the decision process until the newly learned strategy supersedes the hardwired decision logic. Ipeirotis et al (2007) and Kukulenz and Ntoulas (2007) apply utility models to search queries. The resulting query strategies might lead to less accurate results than a brute force approach but optimize the balance between accuracy and cost.…”

Section: Related Literaturementioning

confidence: 99%

“…Despite the obvious importance of optimal stopping for the Semantic Web community, this paper shows the application of a generic approach which might also be applied to related problems in other fields such as information retrieval (Grass and Zilberstein, 2000;Weichselbraun, 2009), autonomous computing (Kephart and Das, 2007;Tesauro et al, 2007), and Web Search (Ipeirotis et al, 2007;Kukulenz and Ntoulas, 2007).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimizing queries to remote resources

Weichselbraun

2010

J Intell Inf Syst

View full text Add to dashboard Cite

One key property of the Semantic Web is its support for interoperability. Recent research in this area focuses on the integration of multiple data sources to facilitate tasks such as ontology learning, user query expansion and context recognition. The growing popularity of such machups and the rising number of Web APIs supporting links between heterogeneous data providers asks for intelligent methods to spare remote resources and minimize delays imposed by queries to external data sources.This paper suggests a cost and utility model for optimizing such queries by leveraging optimal stopping theory from business economics: applications are modeled as decision makers that look for optimal answer sets. Queries to remote resources cause additional cost but retrieve valuable information which improves the estimation of the answer set's utility. Optimal stopping optimizes the trade-off between query cost and answer utility yielding optimal query strategies for remote resources. These strategies are compared to conventional approaches in an extensive evaluation based on real world response times taken from seven popular Web services.

show abstract

Section: Related Literaturementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Optimizing queries to remote resources

Weichselbraun

2010

J Intell Inf Syst

View full text Add to dashboard Cite

show abstract

“…Again, this fundamental distinction of indexing intervals as opposed to points requires the development of new index structures. Work on bounded continuous queries [19] considers the problem of selecting the top-k events for a given subscription over a specified time period. The ranked pub/sub problem, on the other hand, considers the problem of selecting the top-k subscriptions that match a given event.…”

Section: Related Workmentioning

confidence: 99%

Scalable ranked publish/subscribe

et al. 2008

View full text Add to dashboard Cite

Publish/subscribe (pub/sub) systems are designed to efficiently match incoming events (e.g., stock quotes) against a set of subscriptions (e.g., trader profiles specifying quotes of interest). However, current pub/sub systems only support a simple binary notion of matching: an event either matches a subscription or it does not; for instance, a stock quote will either match or not match a trader profile. In this paper, we argue that this simple notion of matching is inadequate for many applications where only the "best" matching subscriptions are of interest. For instance, in targeted Web advertising, an incoming user ("event") may match several different advertiser-specified user profiles ("subscriptions"), but given the limited advertising real-estate, we want to quickly discover the best (e.g., most relevant) ads to display.To address this need, we initiate a study of ranked pub/sub systems. We focus on the case where subscriptions correspond to interval ranges (e.g, age in [25,35] and salary > $50, 000), and events are points that match all the intervals that they stab (e.g., age=28, salary = $65,000). In addition, each interval has a score and our goal is to quickly recover the top-scoring matching subscriptions. Unfortunately, adapting existing index structures to solve this problem results in either an unacceptable space overhead or a significant performance degradation. We thus propose two novel index structures that are both compact and efficient. Our experimental evaluation shows that the proposed structures provide a scalable basis for designing ranked pub/sub systems.

show abstract

“…Web search technologies can retrieve Web documents for input queries, however, it is ill-suited to notify users about rapidly-changing contents. Though Google Alerts [3] and Microsoft Live Alerts [1] provide the dissemination service for end users, it is believed that both alert services are based on batch processing through the search engine [9]. Thus, they cannot offer timely dissemination service.…”

Section: Introductionmentioning

confidence: 99%

STAIRS: Towards Efficient Full-Text Filtering and Dissemination in a DHT Environment

Rao

Chen

et al. 2009

2009 IEEE 25th International Conference on Data Engineering

View full text Add to dashboard Cite

Abstract-Nowadays contents in Internet like weblogs, wikipedia and news sites become "live". How to notify and provide users with the relevant contents becomes a challenge. Unlike conventional Web search technology or the RSS feed, this paper envisions a personalized full-text content filtering and dissemination system in a highly distributed environment such as a Distributed Hash Table (DHT). Users can subscribe to their interested contents by specifying some terms and threshold values for filtering. Then, published contents will be disseminated to the associated subscribers. We propose a novel and simple framework of filter registration and content publication, STAIRS. By the new framework, we propose three algorithms (default forwarding, dynamic forwarding and adaptive forwarding) to reduce the forwarding cost and false dismissal rate; meanwhile, the subscriber can receive the desired contents with no duplicates. In particular, the adaptive forwarding utilizes the filter information to significantly reduce the forwarding cost. Experiments based on two real query logs and two real datasets show the effectiveness of our proposed framework.

show abstract

Answering bounded continuous search queries in the world wide web

Cited by 15 publications

References 29 publications

Optimizing queries to remote resources

Optimizing queries to remote resources

Scalable ranked publish/subscribe

STAIRS: Towards Efficient Full-Text Filtering and Dissemination in a DHT Environment

Contact Info

Product

Resources

About