Sciweavers

1487 search results - page 50 / 298
» Representing and Querying Data Transformations
Sort
View
JSS
2008
139views more  JSS 2008»
15 years 1 months ago
Dynamic interval-based labeling scheme for efficient XML query and update processing
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationsh...
Jung-Hee Yun, Chin-Wan Chung
CC
2007
Springer
109views System Software» more  CC 2007»
15 years 7 months ago
Layout Transformations for Heap Objects Using Static Access Patterns
As the amount of data used by programs increases due to the growth of hardware storage capacity and computing power, efficient memory usage becomes a key factor for performance. Si...
Jinseong Jeon, Keoncheol Shin, Hwansoo Han
CORR
2010
Springer
181views Education» more  CORR 2010»
14 years 12 months ago
Mapping XML Data to Relational Data: A DOM-Based Approach
XML has emerged as the standard for representing and exchanging data on the World Wide Web. It is critical to have efficient mechanisms to store and query XML data to exploit the...
Mustafa Atay, Yezhou Sun, Dapeng Liu, Shiyong Lu, ...
PEPM
2009
ACM
15 years 10 months ago
From spreadsheets to relational databases and back
Abstract. This paper presents techniques and tools to transform spreadsheets into relational databases and back. A set of data refinement rules is introduced to map a tabular data...
Jácome Cunha, João Saraiva, Joost Vi...
ICDE
2009
IEEE
205views Database» more  ICDE 2009»
16 years 3 months ago
Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
Thanh Tran, Haofen Wang, Sebastian Rudolph, Philip...