Sciweavers

958 search results - page 7 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
VLDB
2005
ACM
120views Database» more  VLDB 2005»
14 years 25 days ago
Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is adopted by more and more database systems. For an effic...
Jost Enderle, Nicole Schneider, Thomas Seidl
CAISE
2005
Springer
14 years 27 days ago
Querying Tree-Structured Data Using Dimension Graphs
Abstract. Tree structures provide a popular means to organize the information on the Web. Taxonomies of thematic categories, concept hierarchies, e-commerce product catalogs are ex...
Dimitri Theodoratos, Theodore Dalamagas
PVLDB
2010
190views more  PVLDB 2010»
13 years 2 months ago
Efficient B-tree Based Indexing for Cloud Data Processing
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu
JCP
2006
232views more  JCP 2006»
13 years 7 months ago
Indexing of Motion Capture Data for Efficient and Fast Similarity Search
As motion capture systems are increasingly used for motion tracking and capture, and more and more surveillance cameras are installed for security protection, more and more motion ...
Chuanjun Li, B. Prabhakaran
WWW
2008
ACM
14 years 8 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...