Shahram Ghandeharizadeh - Academia.edu (original) (raw)

Papers by Shahram Ghandeharizadeh

Research paper thumbnail of C2P2: a peer-to-peer network for on-demand automobile information services

Proceedings. 15th International Workshop on Database and Expert Systems Applications, 2004., 2004

This short paper outlines challenges of delivering continuous media and traffic information to mo... more This short paper outlines challenges of delivering continuous media and traffic information to mobile Car-to-Car Peer-to-Peer (C2P2) network of devices. We analyze network connectivity of a C2P2 cloud as a function of radio range of each device. A novel concept introduced by C2P2 is on-demand delivery of continuous media, audio and video clips, to moving vehicles.

Research paper thumbnail of Heraclitus: Elevating Deltas to be First Class Citizens in a Database Programming Language

... Class Citizens in a Language SHAHRAM GHANDEHARIZADEH, University of Southern California Datab... more ... Class Citizens in a Language SHAHRAM GHANDEHARIZADEH, University of Southern California Database Programming RICHARD HULL, and DEAN JACOBS Traditional database systems provide a user with the ability to query and manipulate one ...

Research paper thumbnail of An Evaluation of the Hibernate Object-Relational Mapping for Processing Interactive Social Networking Actions

Proceedings of the 16th International Conference, Dec 4, 2014

Research paper thumbnail of An Optimal Resource Scheduler for Continuous Display of Structured Video Objects

This study presents an optimal resource scheduler for continuous display of structured video. A s... more This study presents an optimal resource scheduler for continuous display of structured video. A structured video consists of a collection of background objects, characters and rendering features. Spatial constructs are used to place objects that constitute a scene in a rendering space while temporal constructs describe how the objects and their relationships evolve as a function of time. When a user requests the display of a video object, the system is provided with a display schedule of objects that must be retrieved by a certain time in order to support a display free of disruptions. Assuming a platform consisting of a xed amount of memory and a magnetic disk drive, this study describes an algorithm that supports such a retrieval while minimizing both the latency observed by a display and its required amount of memory.

Research paper thumbnail of On coordinated display of structured video : Multimedia database systems

Research paper thumbnail of On the Complexity of Resource Scheduling for Coordinated Display of Structured Presentations

On the Complexity of Resource Scheduling for Coordinated Display of Structured Presentations Mart... more On the Complexity of Resource Scheduling for Coordinated Display of Structured Presentations Martha L. Escobar{Molano and Shahram Ghandeharizadeh Computer Science Department University of Southern California ... To illustrate, consider the animation \The Lion King". ...

Research paper thumbnail of Optimal Balanced Assignments and a Parallel Database Application

Orsa Journal on Computing, May 1, 1993

In parallel database systems, distribution of the data among the processors has a significant imp... more In parallel database systems, distribution of the data among the processors has a significant impact on the response time and throughput of the system. The benefits of parallelism (using multiple processors to execute a query) must be balanced against its costs ...

Research paper thumbnail of Design of a Scalable Multimedia Storage Manager

During the past decade, the information technology has evolved to store and retrieve continuous m... more During the past decade, the information technology has evolved to store and retrieve continuous media data types, e.g., audio and video objects. Unlike the traditional data types (e.g., text), this new data type requires its objects to be retrieved at a pre-speci ed bandwidth. If its objects are retrieved at a rate lower than its pre-speci ed bandwidth then a display will su er from frequent disruptions and delays termed hiccups. Storage managers that support a hiccup-free retrieval of continuous media data types are commonly referred to as multimedia storage managers. They are expected to play a major role in many applications including library information systems, entertainment technology, educational applications, etc.

Research paper thumbnail of Proceedings of the 26th International Conference on Data Engineering, ICDE 2010, March 1-6, 2010, Long Beach, California, USA

Research paper thumbnail of SkiPeR: A Family of Distributed Range Addressing Spaces for Peer-to-Peer Systems

Research paper thumbnail of On Configuring Hierarchical Multimedia Storage Managers

Research paper thumbnail of Coordinated Display of Structured Presentations Using a Multi-Disk Architecture

Research paper thumbnail of On Implementing a Language for Specifying Active Database Execution Models

Proceedings of the 19th International Conference on Very Large Data Bases, 1993

A key issue when incorporating rules into database systems concerns understrnding alternative sem... more A key issue when incorporating rules into database systems concerns understrnding alternative semantics of rule application.

Research paper thumbnail of Web services as tools within a scientific knowledge engineering environment

Neuroscience poses a number of challenges to the concept of "software and data as a service" advo... more Neuroscience poses a number of challenges to the concept of "software and data as a service" advocated by Web Services. A primary one is the heterogeneity of the data sources at a conceptual level. In this paper, we describe a knowledge engineering system (called 'NeuroScholar') that acts as a Web Service (WS) for knowledge models based on the published neuroscientific literature. It incorporates several existing web services into a framework that empowers a neuroscientist to represent the neural basis of a predefined physiological phenomenon (e.g.: stress). This paper provides an overview of NeuroScholar and outlines its future research directions.

Research paper thumbnail of Gamma data-base machine project. Technical report

This paper describes the design of the Gamma database machine and the techniques employed in its ... more This paper describes the design of the Gamma database machine and the techniques employed in its implementation. Gamma is a relational database machine currently operating on an Intel iPSC/2 hypercube with 32 processors and 32 disk drives. Gamma employs three key technical ideas which enable the architecture to be scaled to 100s of processors. First, all relations are horizontally partitioned across multiple disk drives enabling relations to be scanned in parallel. Second, novel parallel algorithms based on hashing are used to implement the complex relational operators such as join and aggregate functions. Third, dataflow scheduling techniques are used to coordinate multioperator queries. By using these techniques it is possible to control the execution of very complex queries with minimal coordination - a necessity for configurations involving a very large number of processors. In addition to describing the design of Gamma software, a thorough performance evaluation of the iPSC/2 hypercube version of Gamma is also presented. In addition to measuring the effect of relation size and indices on the response time for selection, join, aggregation, and update queries, we also analyze the performance of Gamma relative to the number of processors employed when the sizes of the input relations are kept constant (speedup) and when the sizes results obtained for both selection and join queries are linear; thus, doubling the number of processors halves the response time for a query.

Research paper thumbnail of Optimal Processor Assignment For Parallel Database Design

... et al [4]). REFERENCES [1] H. BORAL, W. ALEXANDER, L. CLAY, G. COPELAND, S. DANFORTH, M. FRAN... more ... et al [4]). REFERENCES [1] H. BORAL, W. ALEXANDER, L. CLAY, G. COPELAND, S. DANFORTH, M. FRANKLIN, B. HART, M. SMITH, AND P. VALDURIEZ, Prototyping Bubba, a highly ... [4] S. GHANDEHARIZADEH, L. RAMOS, Z. ASAD, AND W. QURESHI, Object placement in ...

Research paper thumbnail of Proteus: A System for Execution of Dynamically Composed Web Services Using GXA Topic Area: Global XML Web Services Architecture (GXA)

The goal of this project is to utilize the GXA framework (i.e., WS-Inspection, WS-Routing, and WS... more The goal of this project is to utilize the GXA framework (i.e., WS-Inspection, WS-Routing, and WS-Referral) to develop Proteus 1 , a system to: a) dynamically compose plans that integrate web services, b) execute a plan as efficiently as possible in the presence of failures and web service migrations, and c) monitor and show the status of different components at runtime. As a motivating example, consider the problem of identifying a building in an image. This can be done by combining web services for imagery (i.e.,TerraService) with services for the property tax sites and online phone books (see the description of our previous work, Section B). One could write a program to integrate information from the appropriate web services to solve this query for a given area, but the challenge is that there are approximately a thousand property tax sites and hundreds of telephone books for the US and each of them has different levels of coverage. For example, in New York State there is one tax service, but in California there are dozens. A better alternative is for a system such as Proteus to dynamically identify, compose, and execute the appropriate web services to process a query. First, Proteus would identify the relevant web services. In our example, relevant web services would include Microsoft's TerraService for imagery, the property tax and telephone book services for the given area, and a geocoding service to convert street addresses into lat/long coordinates. Second, it identifies the most efficient plan and executes it to produce a timely response. Third, it monitors and controls the execution of a plan in support of physical-locationindependence, which means the plan will execute as long as a copy of the referenced web services is available. This criterion is important because it frees the end user (and programmers) by requiring the system to resolve the location of a web service in the presence of both a) web service migrations to balance load, and b) node failures that render a copy of a web service unavailable. In order to monitor the execution of a plan, Proteus will provide visualization tools that query the run-time components for their status.

Research paper thumbnail of Optimal balanced partitions and a parallel database application

Research paper thumbnail of A Comparison of Alternative Techniques to Estimate Response Time for Data Placement

Technological advances in networking, mass storage devices, processor and information technology ... more Technological advances in networking, mass storage devices, processor and information technology have resulted in a variety of data services in diverse applications such as e-commerce, health-care, sci- entific applications, etc. While the cost of purchasing technology is becoming cheaper, the same cannot be stated about the cost of managing an information infrastructure. In order to reduce this cost, one needs tools that empower system administrators to explain and reason about a storage subsystem' s past performance, e.g., response time. Ideally, an administrator would employ these tools to speculate on both physical organization of data and hardware changes. With a hypothetical change, one may use the previously observed response times to quantify the expected enhancements. In this study, we investigate linear regression, a M/D/1 queuing model and SEER as three alternative techniques to estimate response time. All techniques enable an administrator to speculate on changes to ...

Research paper thumbnail of High Performance Parallel DBMS

Parallelism is the key to realizing high performance, scalable, fault tolerant database managemen... more Parallelism is the key to realizing high performance, scalable, fault tolerant database management systems. With the predicted future database sizes and complexity of queries, the scalability of these systems to hundreds and thousands of processors is essential for satisfying the projected demand. This chapter describes three key components of a high performance parallel database management system. First, data partitioning strategies that distribute the workload of a table across the available nodes while minimizing the overhead of parallelism. Second, algorithms for parallel processing of a join operator. Third, ORE as a framework that controls the placement of data to respond to changing workloads and evolving hardware platforms.

Research paper thumbnail of C2P2: a peer-to-peer network for on-demand automobile information services

Proceedings. 15th International Workshop on Database and Expert Systems Applications, 2004., 2004

This short paper outlines challenges of delivering continuous media and traffic information to mo... more This short paper outlines challenges of delivering continuous media and traffic information to mobile Car-to-Car Peer-to-Peer (C2P2) network of devices. We analyze network connectivity of a C2P2 cloud as a function of radio range of each device. A novel concept introduced by C2P2 is on-demand delivery of continuous media, audio and video clips, to moving vehicles.

Research paper thumbnail of Heraclitus: Elevating Deltas to be First Class Citizens in a Database Programming Language

... Class Citizens in a Language SHAHRAM GHANDEHARIZADEH, University of Southern California Datab... more ... Class Citizens in a Language SHAHRAM GHANDEHARIZADEH, University of Southern California Database Programming RICHARD HULL, and DEAN JACOBS Traditional database systems provide a user with the ability to query and manipulate one ...

Research paper thumbnail of An Evaluation of the Hibernate Object-Relational Mapping for Processing Interactive Social Networking Actions

Proceedings of the 16th International Conference, Dec 4, 2014

Research paper thumbnail of An Optimal Resource Scheduler for Continuous Display of Structured Video Objects

This study presents an optimal resource scheduler for continuous display of structured video. A s... more This study presents an optimal resource scheduler for continuous display of structured video. A structured video consists of a collection of background objects, characters and rendering features. Spatial constructs are used to place objects that constitute a scene in a rendering space while temporal constructs describe how the objects and their relationships evolve as a function of time. When a user requests the display of a video object, the system is provided with a display schedule of objects that must be retrieved by a certain time in order to support a display free of disruptions. Assuming a platform consisting of a xed amount of memory and a magnetic disk drive, this study describes an algorithm that supports such a retrieval while minimizing both the latency observed by a display and its required amount of memory.

Research paper thumbnail of On coordinated display of structured video : Multimedia database systems

Research paper thumbnail of On the Complexity of Resource Scheduling for Coordinated Display of Structured Presentations

On the Complexity of Resource Scheduling for Coordinated Display of Structured Presentations Mart... more On the Complexity of Resource Scheduling for Coordinated Display of Structured Presentations Martha L. Escobar{Molano and Shahram Ghandeharizadeh Computer Science Department University of Southern California ... To illustrate, consider the animation \The Lion King". ...

Research paper thumbnail of Optimal Balanced Assignments and a Parallel Database Application

Orsa Journal on Computing, May 1, 1993

In parallel database systems, distribution of the data among the processors has a significant imp... more In parallel database systems, distribution of the data among the processors has a significant impact on the response time and throughput of the system. The benefits of parallelism (using multiple processors to execute a query) must be balanced against its costs ...

Research paper thumbnail of Design of a Scalable Multimedia Storage Manager

During the past decade, the information technology has evolved to store and retrieve continuous m... more During the past decade, the information technology has evolved to store and retrieve continuous media data types, e.g., audio and video objects. Unlike the traditional data types (e.g., text), this new data type requires its objects to be retrieved at a pre-speci ed bandwidth. If its objects are retrieved at a rate lower than its pre-speci ed bandwidth then a display will su er from frequent disruptions and delays termed hiccups. Storage managers that support a hiccup-free retrieval of continuous media data types are commonly referred to as multimedia storage managers. They are expected to play a major role in many applications including library information systems, entertainment technology, educational applications, etc.

Research paper thumbnail of Proceedings of the 26th International Conference on Data Engineering, ICDE 2010, March 1-6, 2010, Long Beach, California, USA

Research paper thumbnail of SkiPeR: A Family of Distributed Range Addressing Spaces for Peer-to-Peer Systems

Research paper thumbnail of On Configuring Hierarchical Multimedia Storage Managers

Research paper thumbnail of Coordinated Display of Structured Presentations Using a Multi-Disk Architecture

Research paper thumbnail of On Implementing a Language for Specifying Active Database Execution Models

Proceedings of the 19th International Conference on Very Large Data Bases, 1993

A key issue when incorporating rules into database systems concerns understrnding alternative sem... more A key issue when incorporating rules into database systems concerns understrnding alternative semantics of rule application.

Research paper thumbnail of Web services as tools within a scientific knowledge engineering environment

Neuroscience poses a number of challenges to the concept of "software and data as a service" advo... more Neuroscience poses a number of challenges to the concept of "software and data as a service" advocated by Web Services. A primary one is the heterogeneity of the data sources at a conceptual level. In this paper, we describe a knowledge engineering system (called 'NeuroScholar') that acts as a Web Service (WS) for knowledge models based on the published neuroscientific literature. It incorporates several existing web services into a framework that empowers a neuroscientist to represent the neural basis of a predefined physiological phenomenon (e.g.: stress). This paper provides an overview of NeuroScholar and outlines its future research directions.

Research paper thumbnail of Gamma data-base machine project. Technical report

This paper describes the design of the Gamma database machine and the techniques employed in its ... more This paper describes the design of the Gamma database machine and the techniques employed in its implementation. Gamma is a relational database machine currently operating on an Intel iPSC/2 hypercube with 32 processors and 32 disk drives. Gamma employs three key technical ideas which enable the architecture to be scaled to 100s of processors. First, all relations are horizontally partitioned across multiple disk drives enabling relations to be scanned in parallel. Second, novel parallel algorithms based on hashing are used to implement the complex relational operators such as join and aggregate functions. Third, dataflow scheduling techniques are used to coordinate multioperator queries. By using these techniques it is possible to control the execution of very complex queries with minimal coordination - a necessity for configurations involving a very large number of processors. In addition to describing the design of Gamma software, a thorough performance evaluation of the iPSC/2 hypercube version of Gamma is also presented. In addition to measuring the effect of relation size and indices on the response time for selection, join, aggregation, and update queries, we also analyze the performance of Gamma relative to the number of processors employed when the sizes of the input relations are kept constant (speedup) and when the sizes results obtained for both selection and join queries are linear; thus, doubling the number of processors halves the response time for a query.

Research paper thumbnail of Optimal Processor Assignment For Parallel Database Design

... et al [4]). REFERENCES [1] H. BORAL, W. ALEXANDER, L. CLAY, G. COPELAND, S. DANFORTH, M. FRAN... more ... et al [4]). REFERENCES [1] H. BORAL, W. ALEXANDER, L. CLAY, G. COPELAND, S. DANFORTH, M. FRANKLIN, B. HART, M. SMITH, AND P. VALDURIEZ, Prototyping Bubba, a highly ... [4] S. GHANDEHARIZADEH, L. RAMOS, Z. ASAD, AND W. QURESHI, Object placement in ...

Research paper thumbnail of Proteus: A System for Execution of Dynamically Composed Web Services Using GXA Topic Area: Global XML Web Services Architecture (GXA)

The goal of this project is to utilize the GXA framework (i.e., WS-Inspection, WS-Routing, and WS... more The goal of this project is to utilize the GXA framework (i.e., WS-Inspection, WS-Routing, and WS-Referral) to develop Proteus 1 , a system to: a) dynamically compose plans that integrate web services, b) execute a plan as efficiently as possible in the presence of failures and web service migrations, and c) monitor and show the status of different components at runtime. As a motivating example, consider the problem of identifying a building in an image. This can be done by combining web services for imagery (i.e.,TerraService) with services for the property tax sites and online phone books (see the description of our previous work, Section B). One could write a program to integrate information from the appropriate web services to solve this query for a given area, but the challenge is that there are approximately a thousand property tax sites and hundreds of telephone books for the US and each of them has different levels of coverage. For example, in New York State there is one tax service, but in California there are dozens. A better alternative is for a system such as Proteus to dynamically identify, compose, and execute the appropriate web services to process a query. First, Proteus would identify the relevant web services. In our example, relevant web services would include Microsoft's TerraService for imagery, the property tax and telephone book services for the given area, and a geocoding service to convert street addresses into lat/long coordinates. Second, it identifies the most efficient plan and executes it to produce a timely response. Third, it monitors and controls the execution of a plan in support of physical-locationindependence, which means the plan will execute as long as a copy of the referenced web services is available. This criterion is important because it frees the end user (and programmers) by requiring the system to resolve the location of a web service in the presence of both a) web service migrations to balance load, and b) node failures that render a copy of a web service unavailable. In order to monitor the execution of a plan, Proteus will provide visualization tools that query the run-time components for their status.

Research paper thumbnail of Optimal balanced partitions and a parallel database application

Research paper thumbnail of A Comparison of Alternative Techniques to Estimate Response Time for Data Placement

Technological advances in networking, mass storage devices, processor and information technology ... more Technological advances in networking, mass storage devices, processor and information technology have resulted in a variety of data services in diverse applications such as e-commerce, health-care, sci- entific applications, etc. While the cost of purchasing technology is becoming cheaper, the same cannot be stated about the cost of managing an information infrastructure. In order to reduce this cost, one needs tools that empower system administrators to explain and reason about a storage subsystem' s past performance, e.g., response time. Ideally, an administrator would employ these tools to speculate on both physical organization of data and hardware changes. With a hypothetical change, one may use the previously observed response times to quantify the expected enhancements. In this study, we investigate linear regression, a M/D/1 queuing model and SEER as three alternative techniques to estimate response time. All techniques enable an administrator to speculate on changes to ...

Research paper thumbnail of High Performance Parallel DBMS

Parallelism is the key to realizing high performance, scalable, fault tolerant database managemen... more Parallelism is the key to realizing high performance, scalable, fault tolerant database management systems. With the predicted future database sizes and complexity of queries, the scalability of these systems to hundreds and thousands of processors is essential for satisfying the projected demand. This chapter describes three key components of a high performance parallel database management system. First, data partitioning strategies that distribute the workload of a table across the available nodes while minimizing the overhead of parallelism. Second, algorithms for parallel processing of a join operator. Third, ORE as a framework that controls the placement of data to respond to changing workloads and evolving hardware platforms.