Sciweavers

10 search results - page 1 / 2
» On building minimal automaton for subset matching queries
Sort
View
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 11 months ago
On building minimal automaton for subset matching queries
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
Kimmo Fredriksson
EDBT
2008
ACM
159views Database» more  EDBT 2008»
14 years 11 months ago
Automaton in or out: run-time plan optimization for XML stream processing
Many systems such as Tukwila and YFilter combine automaton and algebra techniques to process queries over tokenized XML streams. Typically in this architecture, an automaton is fi...
Hong Su, Elke A. Rundensteiner, Murali Mani
NJC
2006
102views more  NJC 2006»
13 years 11 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
DEXA
2009
Springer
153views Database» more  DEXA 2009»
14 years 2 months ago
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, ...
CSB
2005
IEEE
155views Bioinformatics» more  CSB 2005»
14 years 4 months ago
BioNavigation: Using Ontologies to Express Meaningful Navigational Queries Over Biological Resources
Exploiting the complex maze of publicly available Biological resources to implement scientific data collection pipelines poses a multitude of challenges to biologists in accurate...
Zoé Lacroix, Kaushal Parekh, Maria-Esther V...