Welcome to D
SIGMOD 2004
PODS 2004
SIGMOD RECOR
CIKM 2004
DASFAA 2004
DBPL 2003
DE-BULLETIN
DEBS 2004
DMKD 2004
DMSN 2004
DOLAP 2004
DPDJ 2004
EDBT 2004
ER 2003
GIS 2004
HDP 2004
HYPERTEXT 20
ICDE 2004
ICDT 2003
JCDL 2004
MDM
MIR 2004
MIS 2004
MMDB 2004
MOBIDE 2003
RIDE 2004
SBBD 2003
SIGIR FORUM
SIGIR 2004
SIGKDD EXPLO
SIGKDD 2004
SSDBM 2004
SSTD 2003
TIME 2004
TODS 2004
VLDB 2004
VLDB Journal
WEBDB 2004
WIDM 2004
XIME-P 2004
Footer

Rajasekar Krishnamurthy

Papers on DiSC'04


Recursive XML Schemas, Recursive XML Queries, and Relational Storage: XML-to-SQL Query Translation

On the Integration of Structure Indexes and Inverted Lists

On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theoretic Perspective

On the Integration of Structure Indexes and Inverted Lists

Efficient XML-to-SQL Query Translation: Where to Add the Intelligence ?

Unraveling the Duplicate-Elimination Problem in XML-to-SQL Query Translation

Publications


Note: Links lead to the DBLP on the Web.

Rajasekar Krishnamurthy

Rajasekar Krishnamurthy, Raghav Kaushik , Jeffrey F. Naughton : XML Views as Integrity Constraints and their Use in Query Translation. ICDE 2005 : 693-704

Rajasekar Krishnamurthy, Venkatesan T. Chakaravarthy , Raghav Kaushik , Jeffrey F. Naughton : Recursive XML Schemas, Recursive XML Queries, and Relational Storage: XML-to-SQL Query Translation. ICDE 2004 : 42-53

Raghav Kaushik , Rajasekar Krishnamurthy, Jeffrey F. Naughton , Raghu Ramakrishnan : On the Integration of Structure Indexes and Inverted Lists. ICDE 2004 : 829

Raghav Kaushik , Rajasekar Krishnamurthy, Jeffrey F. Naughton , Raghu Ramakrishnan : On the Integration of Structure Indexes and Inverted Lists. SIGMOD Conference 2004 : 779-790

Rajasekar Krishnamurthy, Raghav Kaushik , Jeffrey F. Naughton : Efficient XML-to-SQL Query Translation: Where to Add the Intelligence? VLDB 2004 : 144-155

Rajasekar Krishnamurthy, Raghav Kaushik , Jeffrey F. Naughton : Unraveling the Duplicate-Elimination Problem in XML-to-SQL Query Translation. WebDB 2004 : 49-54

Rajasekar Krishnamurthy, Venkatesan T. Chakaravarthy , Jeffrey F. Naughton : On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theoretic Perspective. ICDT 2003 : 270-284

Alan Halverson , Josef Burger , Leonidas Galanis , Ameet Kini , Rajasekar Krishnamurthy, Ajith Nagaraja Rao , Feng Tian , Stratis Viglas , Yuan Wang , Jeffrey F. Naughton , David J. DeWitt : Mixed Mode XML Query Processing. VLDB 2003 : 225-236

Rajasekar Krishnamurthy, Raghav Kaushik , Jeffrey F. Naughton : XML-SQL Query Translation Literature: The State of the Art and Open Problems. Xsym 2003 : 1-18

Venkatesan T. Chakaravarthy , Rajasekar Krishnamurthy: The Problem of Context Sensitive String Matching. CPM 2002 : 64-75

Jeffrey F. Naughton , David J. DeWitt , David Maier , Ashraf Aboulnaga , Jianjun Chen , Leonidas Galanis , Jaewoo Kang , Rajasekar Krishnamurthy, Qiong Luo , Naveen Prakash , Ravishankar Ramamurthy , Jayavel Shanmugasundaram , Feng Tian , Kristin Tufte , Stratis Viglas , Yuan Wang , Chun Zhang , Bruce Jackson , Anurag Gupta , Rushan Chen : The Niagara Internet Query System. IEEE Data Eng. Bull. 24 (2): 27-33 (2001)

Jayavel Shanmugasundaram , Eugene J. Shekita , Jerry Kiernan , Rajasekar Krishnamurthy, Stratis Viglas , Jeffrey F. Naughton , Igor Tatarinov : A General Techniques for Querying XML Documents using a Relational Database System. SIGMOD Record 30 (3): 20-26 (2001)

Qiong Luo , Jeffrey F. Naughton , Rajasekar Krishnamurthy, Pei Cao , Yunrui Li : Active Query Caching for Database Web Servers. WebDB (Informal Proceedings) 2000 : 29-34

Qiong Luo , Jeffrey F. Naughton , Rajasekar Krishnamurthy, Pei Cao , Yunrui Li : Active Query Caching for Database Web Servers. WebDB (Selected Papers) 2000 : 92-104

1 [ 4 ]

2 [ 7 ]

3 [ 1 ] [ 2 ]

4 [ 5 ] [ 8 ] [ 13 ]

5 [ 4 ]

6 [ 4 ]

7 [ 4 ] [ 7 ]

8 [ 4 ] [ 7 ]

9 [ 4 ]

10 [ 7 ]

11 [ 4 ]

12 [ 4 ]

13 [ 6 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 14 ]

14 [ 3 ]

15 [ 7 ]

16 [ 1 ] [ 2 ]

17 [ 1 ] [ 2 ] [ 4 ]

18 [ 4 ]

19 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 14 ]

20 [ 4 ]

21 [ 11 ] [ 12 ]

22 [ 4 ]

23 [ 7 ]

24 [ 3 ] [ 4 ]

25 [ 3 ]

26 [ 3 ]

27 [ 4 ] [ 7 ]

28 [ 4 ]

29 [ 3 ] [ 4 ] [ 7 ]

30 [ 4 ] [ 7 ]

31 [ 4 ]




©2005 Association for Computing Machinery