• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 271
Next 10 →

Performance Tradeoffs for Client-Server Query Processing

by Michael J. Franklin, Björn Thór Jónsson, Donald Kossmann , 1996
"... The construction of high-performance database systems that combine the best aspects of the relational and object-oriented approaches requires the design of client-server architectures that can fully exploit client and server resources in a flexible manner. The two predominant paradigms for client-se ..."
Abstract - Cited by 77 (17 self) - Add to MetaCart
The construction of high-performance database systems that combine the best aspects of the relational and object-oriented approaches requires the design of client-server architectures that can fully exploit client and server resources in a flexible manner. The two predominant paradigms for client-server

A predicate-based caching scheme for client-server database architectures

by Arthur M. Keller, Julie Basu - The VLDB Journal , 1996
"... Abstract. We propose a new client-side data-caching scheme for relational databases with a central server and multiple clients. Data are loaded into each client cache based on queries executed on the central database at the server. These queries are used to form predicates that describe the cache co ..."
Abstract - Cited by 154 (10 self) - Add to MetaCart
database. We examine the various performance tradeoffs and optimization issues involved in addressing the questions of cache currency and completeness using predicate descriptions and suggest solutions that promote good dynamic behavior. Lower query-response times, reduced message traffic, higher server

Exploring Power-Performance Tradeoffs in Database Systems

by Zichen Xu, Yi-cheng Tu, Xiaorui Wang
"... Abstract — With the total energy consumption of computing systems increasing in a steep rate, much attention has been paid to the design of energy-efficient computing systems and applications. So far, database system design has focused on improving performance of query processing. The objective of t ..."
Abstract - Cited by 30 (7 self) - Add to MetaCart
and control the tradeoffs between power consumption and system performance. We also identify the sources of such savings by investigating the resource consumption features during query processing in DBMSs. To that end, we provide an in-depth anatomy and qualitatively analyze the power profile of typical

Towards the Study of Performance Trade-offs Between Materialized and Virtual Integrated Views

by Richard Hull , 1996
"... Consider the problem of supporting an integrated view over multiple databases. The traditional approach is to use a virtual view, but recent investigations are proposing to use a materialized view, or a hybrid virtual/materialized view. This paper initiates an investigation into the performance trad ..."
Abstract - Cited by 12 (0 self) - Add to MetaCart
mediator-based integration environment is similar to that of a client-server DBMS architecture. However, the notion of query freshness does not explicitly arise in a single DBMS, and complex joins may more likely in an integration environment. This paper lays the groundwork for conducting benchmarking

Balancing Performance, Energy, and Quality in Pervasive Computing

by Jason Flinn, Soyoung Park, M. Satyanarayanan - In Proceedings of the 22nd International Conference on. Distributed Computing Systems , 2002
"... We describe Spectra, a remote execution system for batterypowered clients used in pervasive computing. Spectra enables applications to combine the mobility of small devices with the greater processing power of static compute servers. Spectra is self-tuning: it monitors both application resource usag ..."
Abstract - Cited by 74 (6 self) - Add to MetaCart
We describe Spectra, a remote execution system for batterypowered clients used in pervasive computing. Spectra enables applications to combine the mobility of small devices with the greater processing power of static compute servers. Spectra is self-tuning: it monitors both application resource

COMMUNICATION-SPACE TRADEOFFS FOR UNRESTRICTED PROTOCOLS*

by Paul Beamef, Martin Tompaf, Peiyuan Yan
"... Abstract. This paper introduces communicating branching programs and develops a general technique for demonstrating communication-space tradeoffs for pairs ofcommunicating branching programs. This technique is then used to prove communication-space tradeoffs for any pair ofcommunicating branching pr ..."
Abstract - Add to MetaCart
(n / log n). These are the first examples of communication-space tradeoffs on a completely general model of communicating processes. Key words, communication complexity, lower bound, tradeoff, branching program, universal family of hash functions AMS subject classifications. 68Q05, 68Q10, 68Q22, 68Q25 1

• Add counter using performance queries, page 45

by Perfmon Logs
"... • Call-processing activity monitoring, page 20 • Call-processing logs, page 22 • Perform session trace, page 23 • Services monitoring, page 29 • Service logs, page 30 ..."
Abstract - Add to MetaCart
• Call-processing activity monitoring, page 20 • Call-processing logs, page 22 • Perform session trace, page 23 • Services monitoring, page 29 • Service logs, page 30

SnapToQuery: Providing Interactive Feedback during Exploratory Query Specification

by Lilong Jiang , Arnab Nandi
"... ABSTRACT A critical challenge in the data exploration process is discovering and issuing the "right" query, especially when the space of possible queries is large. This problem of exploratory query specification is exacerbated by the use of interactive user interfaces driven by mouse, tou ..."
Abstract - Add to MetaCart
ABSTRACT A critical challenge in the data exploration process is discovering and issuing the "right" query, especially when the space of possible queries is large. This problem of exploratory query specification is exacerbated by the use of interactive user interfaces driven by mouse

Query Evaluation with Constant Delay

by Thèse De Doctorat, Normale Supérieure, De Cachan, Présentée Par, Monsieur Wojciech Kazana, Docteur De, Supérieure De Cachan, Nicole Bidoit, Professeur Président, Arnaud Durand, Patrice Ossona, Mendez Chargé, Victor Vianu, Professeur Examinateur, Luc Segoufin, Directeur Recherche Directeur
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract - Add to MetaCart
I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available

Continuously Updating Query Results over Real-Time Linked Data

by Ruben Taelman , Ruben Verborgh , Pieter Colpaert , Erik Mannens , Rik Van De Walle
"... Abstract. Existing solutions to query dynamic Linked Data sources extend the language, and require continuous server processing for each query. Traditional endpoints accept highly expressive queries, contributing to high server cost. Extending these endpoints for time-sensitive queries increases th ..."
Abstract - Add to MetaCart
updating results. Our experiments indicate that this extension significantly lowers the server complexity. The trade-off is an increase in the execution time per query. We prove that by moving the complexity of continuously evaluating real-time queries over Linked Data to the clients and thus increasing
Next 10 →
Results 1 - 10 of 271
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2016 The Pennsylvania State University