Sciweavers

3020 search results - page 221 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
DEBS
2007
ACM
15 years 8 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
WWW
2003
ACM
16 years 7 months ago
Piazza: data management infrastructure for semantic web applications
The Semantic Web envisions a World Wide Web in which data is described with rich semantics and applications can pose complex queries. To this point, researchers have defined new l...
Alon Y. Halevy, Zachary G. Ives, Peter Mork, Igor ...
USENIX
2007
15 years 9 months ago
Hyperion: High Volume Stream Archival for Retrospective Querying
Network monitoring systems that support data archival and after-the-fact (retrospective) queries are useful for a multitude of purposes, such as anomaly detection and network and ...
Peter Desnoyers, Prashant J. Shenoy
ICDE
2006
IEEE
127views Database» more  ICDE 2006»
16 years 22 days ago
Processing Recursive XQuery over XML Streams: The Raindrop Approach
— XML stream applications bring the challenge of efficiently processing queries on sequentially accessible tokenbased data. For efficient processing of queries, we need to ensu...
Mingzhu Wei, Ming Li, Elke A. Rundensteiner, Mural...
STACS
1997
Springer
15 years 10 months ago
Predecessor Queries in Dynamic Integer Sets
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
Gerth Stølting Brodal