Sciweavers

515 search results - page 37 / 103
» Temporal XML: modeling, indexing, and query processing
Sort
View
ICSNC
2007
IEEE
14 years 2 months ago
Efficient Transformation Scheme for Indexing Continuous Queries on RFID Streaming Data
RFID data are usually regarded as streaming data that are huge and change frequently because they are gathered continuously by numerous readers. RFID middleware filters the data a...
Jaekwan Park, Bonghee Hong, ChaeHoon Ban
CIKM
2009
Springer
13 years 12 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
JIDM
2010
155views more  JIDM 2010»
13 years 6 months ago
DeweyIDs - The Key to Fine-Grained Management of XML Documents
Because XML documents tend to be very large and are more and more collaboratively processed, their fine-grained storage and management is a must for which, in turn, a flexible tree...
Michael Peter Haustein, Theo Härder, Christia...
GEOINFO
2003
13 years 9 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
VLDB
2005
ACM
139views Database» more  VLDB 2005»
14 years 1 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....