Sciweavers

2095 search results - page 42 / 419
» Modeling and Querying Semi-structured Data
Sort
View
EDBT
2000
ACM
15 years 1 months ago
A Data Model for Effectively Computable Functions
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
Kevin H. Xu
MDM
2007
Springer
152views Communications» more  MDM 2007»
15 years 3 months ago
ConQuer: A Peer Group-Based Incentive Model for Constraint Querying in Mobile-P2P Networks
— In mobile ad-hoc peer-to-peer (M-P2P) networks, economic models become a necessity for enticing non-cooperative mobile peers to provide service. M-P2P users may issue queries w...
Anirban Mondal, Sanjay Kumar Madria, Masaru Kitsur...
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 18 days ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
AAAI
2008
15 years 3 days ago
Hierarchical Location and Topic Based Query Expansion
In this paper, we propose a novel approach to expand queries by exploring both location information and topic information of the queries. Users at different locations tend to have...
Shu Huang, Qiankun Zhao, Prasenjit Mitra, C. Lee G...
DAWAK
2001
Springer
15 years 2 months ago
Shared Index Scans for Data Warehouses
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
Yannis Kotidis, Yannis Sismanis, Nick Roussopoulos