Sciweavers

96 search results - page 11 / 20
» Path Constraints in Semistructured Databases
Sort
View
ISMIS
2011
Springer
14 years 16 days ago
Data Access Paths in Processing of Sets of Frequent Itemset Queries
Abstract. Frequent itemset mining can be regarded as advanced database querying where a user specifies the dataset to be mined and constraints to be satisfied by the discovered i...
Piotr Jedrzejczak, Marek Wojciechowski
66
Voted
DASFAA
2003
IEEE
84views Database» more  DASFAA 2003»
15 years 2 months ago
Supporting Selection-Projection XQuery Processing Based on Encoding Paths
Providing an efficient way to support XML query processing has become a very important issue. A system called XQP (XQuery Processor) is proposed in this paper to meet the need. X...
Ya-Hui Chang, Cheng-Ta Lee
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
15 years 11 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
APBC
2003
141views Bioinformatics» more  APBC 2003»
14 years 11 months ago
Comparison of Metabolic Pathways using Constraint Graph Drawing
Databases contain a large amount of data about metabolic pathways, in particular about similar pathways in different species. Biologists are familiar with visual representations ...
Falk Schreiber
SSD
2005
Springer
153views Database» more  SSD 2005»
15 years 3 months ago
Constrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...