MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named Divyakant Agrawal – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 129 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Abbadi. Reducing storage for quorum consensus algorithms  
  • by Divyakant Agrawal, Abetrae T — 1988 — In Proceedings of Very Large Databases Conference
  • …In this paper, we first develop a fragmentation method that reduces the storage overhead of replicated ob-jects. We then present a data management protocol for these fragmented objects, and show that this protocol is a generalisation of quorum consensus algorithms for replicated data in which object…
  • Cited by 3 (0 self) – Add To MetaCart
  • Scheduling Tertiary I/O in Database Applications  
  • by Sunil Prabhakar Divyakant, Sunil Prabhakar, Divyakant Agrawal, Amr El, Abbadi Ambuj Singh — 1997 — In Proc. of the 8th International Workshop on Database and Expert Systems Applications
  • …We study the problem of scheduling I/O requests for tertiary storage libraries to improve performance. The focus is on scheduling policies that process all requests on a loaded medium before unloading it. For single drive settings an efficient algorithm that produces optimal schedules is developed. …
  • Add To MetaCart
  • Optimal Partitioning for Spatial Data  
  • by Hakan Ferhatosmanoglu Divyakant, Divyakant Agrawal, Amr El Abbadi
  • …It is desirable to design partitioning techniques that minimize the I/O time incurred during query execution in spatial databases. In this paper, we explore optimal partitioning techniques for spatial data for different types of queries. In particular, we show that hexagonal partitioning has optimal…
  • Add To MetaCart
  • A Comparison of DFT and DWT Based Similarity Search in Time-Series Databases  
  • by Yi-Leh Wu Divyakant, Divyakant Agrawal, Amr El Abbadi — 2000 — In Proceedings of the 9 th International Conference on Information and Knowledge Management
  • …Similarity search in time-series databases has received significant attention lately. Popular techniques for efficient retrieval of time sequences in time-series databases has been to use Discrete Fourier Transform (DFT). Recently, the Discrete Wavelet Transform (DWT) has gained popular interest in …
  • Add To MetaCart
  • Declustering two-dimensional datasets over MEMS-based Storage  
  • by Hailing Yu Divyakant, Divyakant Agrawal, Amr El Abbadi — 2003 — In EDBT
  • …Due to the large difference between seek time and transfer time in current disk technology, it is advantageous to perform large I/O using a single sequential access rather than multiple small random I/O accesses. However, prior optimal cost and data placement approaches for processing range querie…
  • Add To MetaCart
  • Evaluating Weak Memories with Maya  
  • by Divyakant Agrawal Manhoi, Divyakant Agrawal, Manhoi Choy, Hong Va, Leong Ambuj, K. Singh — 1994 — In Proc. of the 8th Workshop on Parallel and Distributed Simulation
  • …Maya is a simulation platform for evaluating the performance of parallel programs on parallel architectures with different memory coherence protocols. Rapid prototyping of different memory protocols supporting varying degrees of coherence is possible and the impact of these protocols on the perfor…
  • Add To MetaCart
  • Distributed Optimistic Concurrency Control with Reduced Rollback  
  • by Divyakant Agrawal, Arthur J. Bernstein, Pankaj Gupta, Soumitra Sengupta, Divyakant Agrawal Is Currently — 1987 — Distributed Computing
  • …terests include design of algo-rithms for concurrent systems, optimistic protocols and distrib-uted systems. Arthur Bernstein is a Professor of Computer Science at the State…
  • Cited by 5 (0 self) – Add To MetaCart
  • Search-quality Tradeoffs for Routing in Non-ideal Wireless Networks  
  • by Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri
  • …Typical wireless routing protocols like AODV/DSR are not scalable to very large networks because they employ flooding for route discovery. Geographic routing protocols like GPSR are highly scalable because they require minimum control overhead, but depend on idealized link quality models (such as th…
  • Add To MetaCart
  • Power aware routing for sensor databases  
  • by Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri — 2005 — in Proc. IEEE Infocom’05
  • …Abstract — Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB [1] are the dominant architectures to extract and manage data in such networks. Since sensors have significant power constraints (battery life), an…
  • Cited by 4 (0 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB