Sciweavers

1381 search results - page 157 / 277
» Structural signatures for tree data structures
Sort
View
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
15 years 10 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
ERLANG
2003
ACM
15 years 3 months ago
A study of Erlang ETS table implementations and performance
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
Scott Lystig Fritchie
EDBT
2002
ACM
129views Database» more  EDBT 2002»
15 years 10 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
ICC
2007
IEEE
180views Communications» more  ICC 2007»
15 years 4 months ago
Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks
— In contrast to the traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, new generation of information processing applicatio...
Murat Demirbas, Xuming Lu
CICLING
2005
Springer
15 years 3 months ago
Incremental Information Extraction Using Tree-Based Context Representations
Abstract. The purpose of information extraction (IE) is to find desired pieces of information in natural language texts and store them in a form that is suitable for automatic pro...
Christian Siefkes