Sciweavers

1672 search results - page 211 / 335
» Optimizing Monitoring Queries over Distributed Data
Sort
View
IJCAI
1997
15 years 7 months ago
Efficiently Executing Information-Gathering Plans
Themost costly aspect of gathering information over the Internet is that of transferring data over the networkto answer the user’s query. Wemaketwo contributions in this paperth...
Marc Friedman, Daniel S. Weld
DBPL
2007
Springer
136views Database» more  DBPL 2007»
16 years 15 days ago
Analysis of Imperative XML Programs
The widespread adoption of XML has led to programming languages that support XML as a first class construct. In this paper, we present a method for analyzing and optimizing impera...
Michael G. Burke, Igor Peshansky, Mukund Raghavach...
ICNP
2002
IEEE
15 years 11 months ago
An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
Dahai Xu, Chunming Qiao, Yizhi Xiong
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
15 years 7 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
CORR
2010
Springer
106views Education» more  CORR 2010»
15 years 6 months ago
The WebContent XML Store
In this article, we describe the XML storage system used in the WebContent project. We begin by advocating the use of an XML database in order to store WebContent documents, and w...
Benjamin Nguyen, Spyros Zoupanos