Scalability of Persistent Queries

Slides:



Advertisements
Similar presentations
Haystack: Per-User Information Environment 1999 Conference on Information and Knowledge Management Eytan Adar et al Presented by Xiao Hu CS491CXZ.
Advertisements

Scalable Content-aware Request Distribution in Cluster-based Network Servers Jianbin Wei 10/4/2001.
Web Search – Summer Term 2006 VI. Web Search - Indexing (c) Wolfgang Hürst, Albert-Ludwigs-University.
Monitoring and controlling VRVS Reflectors Catalin Cirstoiu 3/7/2003.
Oregon Common Core State Standards Transitioning to New Standards and Assessments.
INEX 2009 XML Mining Track James Reed Jonathan McElroy Brian Clevenger.
1 Maximizing Remote Work in Flooding-based P2P Systems Qixiang Sun Neil Daswani Hector Garcia-Molina Stanford University.
A Mobile Agent Infrastructure for QoS Negotiation of Adaptive Distributed Applications Roberto Speicys Cardoso & Fabio Kon University of São Paulo – USP.
Managing Agent Platforms with the Simple Network Management Protocol Brian Remick Thesis Defense June 26, 2015.
How to Design a Web Site An Overview. Center for Teaching and Learning - PS 1005 Brainstorming/Envisioning Why make a site? Who is your audience? Why.
Tcl Agent : A flexible and secure mobile-agent system Paper by Robert S. Gray Dartmouth College Presented by Vipul Sawhney University of Pennsylvania.
0-1 Team ?? Status Report (1 of 3) Client Contact –Point 1 –Point 2 Team Meetings –Point 1 –Point 2 Team Organization –Point 1 –Point 2 Team 1: Auraria.
Memoplex Browser: Searching and Browsing in Semantic Networks CPSC 533C - Project Update Yoel Lanir.
Backbone Support for Host Mobility: A Joint ORBIT/VINI Experiment Jennifer Rexford Princeton University Joint work with the ORBIT team (Rutgers) and Andy.
Module 17 Storing XML Data in SQL Server® 2008 R2.
Lecture Week 2 Networks, The Internet and the World Wide Web.
Managing Large RDF Graphs (Infinite Graph) Vaibhav Khadilkar Department of Computer Science, The University of Texas at Dallas FEARLESS engineering.
Module 13: Network Load Balancing Fundamentals. Server Availability and Scalability Overview Windows Network Load Balancing Configuring Windows Network.
Detecting Near-Duplicates for Web Crawling Manku, Jain, Sarma
Peter R. Pietzuch THEMIS: Fairness in Data Stream Processing under Overload Evangelia Kalyvianaki City University London, UK Model-driven.
1 SD-Rtree: A Scalable Distributed Rtree Witold Litwin & Cédric du Mouza & Philippe Rigaux.
CS 111 – Nov. 19 Enterprise databases, continued –Review tables, joins, queries –Restricting one’s view of entire database –Design considerations –Concurrency.
Master Thesis Defense Jan Fiedler 04/17/98
The Effect of Collection Organization and Query Locality on IR Performance 2003/07/28 Park,
Web Services and Application of Multi-Agent Paradigm for DL Yueyu Fu & Javed Mostafa School of Library and Information Science Indiana University, Bloomington.
Toward A Session-Based Search Engine Smitha Sriram, Xuehua Shen, ChengXiang Zhai Department of Computer Science University of Illinois, Urbana-Champaign.
1 MSc Project Yin Chen Supervised by Dr Stuart Anderson 2003 Grid Services Monitor Long Term Monitoring of Grid Services Using Peer-to-Peer Techniques.
For: CS590 Intelligent Systems Related Subject Areas: Artificial Intelligence, Graphs, Epistemology, Knowledge Management and Information Filtering Application.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Architecture Models. Readings r Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3 m Note: All figures from this book.
Clustering C.Watters CS6403.
Superior Court Forms Application Rabhan, Inc..  Background  Application Information  Application Demo  Questions Superior Court Forms Application.
Mobile Agents For Mobile Computing Department Of Computer Science – Dartmouth College Robert Gray David Kotz Saurab Nog Daniela Rus George Cybenko.
Computing Simulation in Orders Based Transparent Parallelizing Pavlenko Vitaliy Danilovich, Odessa National Polytechnic University Burdeinyi Viktor Viktorovych,
A NOVEL PREFETCHING METHOD FOR SCENE-BASED MOBILE SOCIAL NETWORK SERVICE 作者 :Song Li, Wendong Wang, Yidong Cui, Kun Yu, Hao Wang 報告者 : 饒展榕.
Multimedia Information System Lab. Network Architecture Res. Group Cooperative Video Streaming Mechanisms with Video Quality Adjustment Naoki Wakamiya.
Research of P2P Architecture based on Cloud Computing Speaker : 吳靖緯 MA0G0101.
D’Agents 1 Presented by Haiying Tan May, 2002 D’Agents: Security in a multiple-language, mobile-agent system Robert S. Gary, David Kotz, George Cybenko,
1 Grid Activity Summary » Grid Testbed » CFD Application » Virtualization » Information Grid » Grid CA.
Gravitational N-body Simulation Major Design Goals -Efficiency -Versatility (ability to use different numerical methods) -Scalability Lesser Design Goals.
Big traffic data processing framework for intelligent monitoring and recording systems 學生 : 賴弘偉 教授 : 許毅然 作者 : Yingjie Xia a, JinlongChen a,b,n, XindaiLu.
Change Display of a Key Figure While in the Change Query (Local Definition) Hiding 1.Right click.
CMSC 691B Multi-Agent System A Scalable Architecture for Peer to Peer Agent by Naveen Srinivasan.
Scalable Methods for Estimating Document Frequencies of Collocations in Databases Tan Yee Fan 2006 December 15 WING Group Meeting.
Lu Qin Center of Quantum Computation and Intelligent Systems, University of Technology, Australia Jeffery Xu Yu The Chinese University of Hong Kong, China.
Machine Learning Lecture 4: Unsupervised Learning (clustering) 1.
Data Structures: A Pseudocode Approach with C 1 Chapter 5 Objectives Upon completion you will be able to: Explain the design, use, and operation of a linear.
VGrADS and GridSolve Asim YarKhan Jack Dongarra, Zhiao Shi, Fengguang Song Innovative Computing Laboratory University of Tennessee VGrADS Workshop – September.
Mark Heggli Innovative Hydrology, Inc. Consultant to the World Bank Expert Real-time Hydrology Information Systems Module 12: Assuming Management of an.
A NOVEL PREFETCHING METHOD FOR SCENE- BASED MOBILE SOCIAL NETWORK SERVICE 作者 :SONG LI, WENDONG WANG, YIDONG CUI, KUN YU, HAO WANG 報告者 : 饒展榕.
Fleet Battle Experiments
Introduction to Wireless Sensor Networks
Web Services and Application of Multi-Agent Paradigm for DL
Document SQL Server with PowerShell
CHAPTER 3 Architectures for Distributed Systems
Grid Mobile-Agent System (GMAS)
Memory Management for Scalable Web Data Servers
Onlineitguru Selenium is one of the most widely used open-source tool that is used for testing software or Automation. It is licensed under Apache License.
Field Teams and Wireless Networks
ECE 539 Project Aditya Ghule
Designing Business Intelligence Solutions with Microsoft SQL Server
Scalable, distributed database system built on multicore systems
Prepared by: Mahmoud Rafeek Al-Farra
Large-Scale Mobile-Agent Systems
Mobile-Agent Scalability
D’Agents: A Mobile-Agent System
CloudAnt: Database as a Service (DBaaS)
Modeling of Mobile Agent Performance
Systems Analysis Project
Sample C2 System 16 Agents on 2 (physical) Nodes
Presentation transcript:

Scalability of Persistent Queries Dartmouth Dartmouth College Scalability of Persistent Queries (Contact: Daniela Rus, rus@cs.dartmouth.edu) Mobile Agent Persistent Query System Persistent Query Module Inside each Query A News articles S e r v a l Persistent Query Server Analyst’s machine at HQ A 1. Agent jumps to server machine with query. 2. Persistent query server retrieves and clusters existing documents. 3. Agent sends clusters back to analyst. Soldier in the field A Star Clustering Algorithm 3 4 1 2 Serval Architecture Estimate degrees of nodes by sampling similarities Find and mark star cluster centers Insert documents into appropriate clusters Scalability of Persistent Queries Lessons Learned: 1) sampled star is effective and scalable for persistent queries 2) agents can do local processing on the persistent-query results before sending the documents back 3) avoid information overload 4) current implementation can sustain 1,600 persistent queries 5) sampled star algorithm solves the memory problems observed with the star implementation 6) future direction for modeling and scalability experiments for the Mobility TIE Dartmouth