Sciweavers

2889 search results - page 426 / 578
» Querying Structured Hyperdocuments
Sort
View
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
14 years 8 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
VLDB
2007
ACM
136views Database» more  VLDB 2007»
14 years 8 months ago
A STEP Towards Realizing Codd's Vision of Rendezvous with the Casual User
This demonstration showcases the STEP system for natural language access to relational databases. In STEP an administrator authors a highly structured semantic grammar through cou...
Michael Minock
SIGMOD
2007
ACM
105views Database» more  SIGMOD 2007»
14 years 8 months ago
Sonnet: an efficient distributed content-based dissemination broker
In this demonstration, we present a prototype content-based dissemination broker, called Sonnet, which is built upon structured overlay network. It combines approximate filtering ...
Aoying Zhou, Weining Qian, Xueqing Gong, Minqi Zho...
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 8 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
EDBT
2006
ACM
112views Database» more  EDBT 2006»
14 years 8 months ago
Expressiveness and Performance of Full-Text Search Languages
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for...
Chavdar Botev, Sihem Amer-Yahia, Jayavel Shanmugas...