Sciweavers

685 search results - page 79 / 137
» Efficient Filtering Query Indexing in Data Stream
Sort
View
INFOCOM
2006
IEEE
14 years 3 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
VLDB
1991
ACM
141views Database» more  VLDB 1991»
14 years 13 days ago
Efficiency of Nested Relational Document Database Systems
Systems designed for efficient retrieval of conventional data can be very inefficient at retrieving documents. Documents have more complex structure than conventional data, and th...
Justin Zobel, James A. Thom, Ron Sacks-Davis
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 10 months ago
Similarity Search in Sets and Categorical Data Using the Signature Tree
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
Nikos Mamoulis, David W. Cheung, Wang Lian
RTCSA
2008
IEEE
14 years 3 months ago
Efficient Query Processing for Tracing RFID Tags by Reordering Location Identifiers
This paper addresses the problem of using the Location IDentifier (LID) as the domain value of the index for trajectories of RFID tags and proposes the solution for solving this p...
Sungwoo Ahn, Bonghee Hong
ENTCS
2008
116views more  ENTCS 2008»
13 years 9 months ago
Phil: A Lazy Implementation of a Language for Approximate Filtering of XML Documents
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
Michele Baggi, Demis Ballis