Sciweavers

1429 search results - page 68 / 286
» Efficient processing of XPath queries using indexes
Sort
View
KDD
2004
ACM
168views Data Mining» more  KDD 2004»
14 years 9 months ago
Mining, indexing, and querying historical spatiotemporal data
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...
Nikos Mamoulis, Huiping Cao, George Kollios, Mario...
VLDB
2005
ACM
139views Database» more  VLDB 2005»
14 years 2 months ago
Tree-Pattern Queries on a Lightweight XML Processor
Popular XML languages, like XPath, use “treepattern” queries to select nodes based on their structural characteristics. While many processing methods have already been propose...
Mirella Moura Moro, Zografoula Vagena, Vassilis J....
CIKM
2009
Springer
14 years 24 days ago
Multidimensional routing indices for efficient distributed query processing
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
BTW
2003
Springer
94views Database» more  BTW 2003»
14 years 2 months ago
The Paradigm of Relational Indexing: a Survey
Abstract: In order to achieve efficient execution plans for queries comprising userdefined data types and predicates, the database system has to be provided with appropriate index ...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
DKE
2008
91views more  DKE 2008»
13 years 9 months ago
SUSAX: Context-specific searching in XML documents using sequence alignment techniques
Keyword searching while very successful in narrowing down the contents of the Web to the pertaining subset of information, has two primary drawbacks. First, the accuracy of the se...
Kajal T. Claypool