Sciweavers

1429 search results - page 15 / 286
» Efficient processing of XPath queries using indexes
Sort
View
COMAD
2008
13 years 9 months ago
Efficient Evaluation of Forward XPath Axes over XML Streams
Although many algorithms have been proposed for evaluating XPath queries containing un-ordered axes (child, descendant, parent and ancestor) against streaming XML data, there are ...
Abdul Nizar, P. Sreenivasa Kumar
PVLDB
2008
154views more  PVLDB 2008»
13 years 7 months ago
Indexing land surface for efficient kNN query
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
Cyrus Shahabi, Lu-An Tang, Songhua Xing
CIKM
2006
Springer
13 years 9 months ago
Processing relaxed skylines in PDMS using distributed data summaries
Peer Data Management Systems (PDMS) are a natural extension of heterogeneous database systems. One of the main tasks in such systems is efficient query processing. Insisting on co...
Katja Hose, Christian Lemke, Kai-Uwe Sattler
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
14 years 8 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh
DBKDA
2010
IEEE
169views Database» more  DBKDA 2010»
14 years 17 days ago
XLeaf: Twig Evaluation with Skipping Loop Joins and Virtual Nodes
Abstract—XML indexing and search has become an important topic, and twig joins are key building blocks in XML search systems. This paper describes a novel approach using a nested...
Nils Grimsmo, Truls Amundsen Bjørklund, &Os...