Sciweavers

262 search results - page 12 / 53
» XML keyword query refinement
Sort
View
CIKM
2003
Springer
14 years 27 days ago
Building XML statistics for the hidden web
There have been several techniques proposed for building statistics for static XML data. However, very little work has been done in the area of building XML statistics for data so...
Ashraf Aboulnaga, Jeffrey F. Naughton
PVLDB
2008
167views more  PVLDB 2008»
13 years 6 months ago
Keyword search on external memory data graphs
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural "lowest common denominator" representation which can combi...
Bhavana Bharat Dalvi, Meghana Kshirsagar, S. Sudar...
VLDB
2005
ACM
144views Database» more  VLDB 2005»
14 years 1 months ago
Bidirectional Expansion For Keyword Search on Graph Databases
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
Varun Kacholia, Shashank Pandit, Soumen Chakrabart...
WWW
2004
ACM
14 years 8 months ago
Mining anchor text for query refinement
When searching large hypertext document collections, it is often possible that there are too many results available for ambiguous queries. Query refinement is an interactive proce...
Reiner Kraft, Jason Y. Zien
XIMEP
2005
ACM
121views Database» more  XIMEP 2005»
14 years 1 months ago
Adaptive XML Storage or The Importance of Being Lazy
Building an XML store means finding solutions to the problems of representing, accessing, querying and updating XML data. The irregularity of both the structure and usage of XML, ...
Cristian Duda, Donald Kossmann