BibSLEIGH — Hongjun

Travelled to:

1 × Australia
1 × Chile
1 × Egypt
1 × France
1 × Germany
1 × Italy
1 × Norway
1 × Sweden
1 × Switzerland
3 × Canada
9 × USA

Collaborated with:

J.X.Yu W.Wang H.Jiang B.C.Ooi K.Tan M.J.Carey W.Lou Z.Tian A.K.H.Tung S.Chen Y.Diao H.Liu L.Feng J.Han R.Ramnarayan ∅ A.Zhou Y.C.Tay R.Setiono H.Liu S.Dao C.C.Low C.Y.Chan M.Shan J.P.Richardson K.P.Mikkilineni G.P.C.Fung P.S.Yu C.Xia J.Hu Z.Chong G.Liu D.Meretakis D.Fragoudis S.Likothanassis W.Fan J.Lu R.Rastogi H.Wang X.Lin J.Li J.Wang H.Zeng Z.Chen L.Tao W.Ma G.Wang G.Yu Y.Bao J.Lv Y.Yu D.W.Cheung B.Zhou B.Kao T.W.Lam H.Ting S.Zheng Y.Liang L.Zhang W.Ji

Talks about:

base (9) queri (8) join (7) data (7) process (6) mine (5) transact (4) effici (4) associ (4) index (4)

Person: Hongjun Lu

DBLP: Lu:Hongjun

Contributed to:

2005

2004

2003

2002

2001

2000

1999

1998

1995

1994

1992

1990

1988

1987

1986

1985

Wrote 33 papers:

VLDB-2005-FanYLLR #query #recursion #sql #xpath: Query Translation from XPath to SQL in the Presence of Recursive DTDs (WF, JXY, HL, JL, RR), pp. 337–348.
VLDB-2005-FungYYL #detection #parametricity: Parameter Free Bursty Events Detection in Text Streams (GPCF, JXY, PSY, HL), pp. 181–192.
VLDB-2005-WangWLJLL #performance #query #using #xml: Efficient Processing of XML Path Queries Using the Disk-based F&B Index (WW, HW, HL, HJ, XL, JL), pp. 145–156.
SIGMOD-2004-JiangLW #performance #query: Efficient Processing of Twig Queries with OR-Predicates (HJ, HL, WW), pp. 59–70.
VLDB-2004-WangJLY #estimation #xml: Bloom Histogram: Path Selectivity Estimation for XML Data with Updates (WW, HJ, HL, JXY), pp. 240–251.
VLDB-2004-XiaLOH #named #performance: Gorder: An Efficient Method for KNN Join Processing (CX, HL, BCO, JH), pp. 756–767.
VLDB-2004-YuCLZ #data type #mining #transaction: False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams (JXY, ZC, HL, AZ), pp. 204–215.
KDD-2003-LiuLLY #on the #query: On computing, storing and querying frequent patterns (GL, HL, WL, JXY), pp. 607–612.
SIGIR-2003-WangZCLTM #clustering #multi #named: ReCoM: reinforcement clustering of multi-type interrelated data objects (JW, HJZ, ZC, HL, LT, WYM), pp. 274–281.
SIGMOD-2003-WangJLY #estimation #modelling: Containment Join Size Estimation: Models and Methods (WW, HJ, HL, JXY), pp. 145–156.
VLDB-2003-JiangWL #documentation #xml: Holistic Twig Joins on Indexed XML Documents (HJ, WW, HL, JXY), pp. 273–284.
CIKM-2002-LouL #performance #predict #web: Efficient prediction of web accesses on a proxy server (WL, HL), pp. 169–176.
SIGMOD-2002-LuWYBLY #named: XBase: making your gigabyte disk queriable (HL, GW, GY, YB, JL, YY), p. 630.
VLDB-2001-ZhouLZLZJT #database #named #visual notation: VXMLR: A Visual XML-Relational Database System (AZ, HL, SZ, YL, LZ, WJ, ZT), pp. 719–720.
CIKM-2000-MeretakisFLL #classification #scalability: Scalable association-based text classification (DM, DF, HL, SL), pp. 5–11.
SIGMOD-2000-ChenDLT #learning #named #query #web: Fact: A Learning Based Web Query Processing System (SC, YD, HL, ZT), p. 587.
VLDB-2000-DiaoLCT #learning #query #towards #web: Toward Learning Based Web Query Processing (YD, HL, SC, ZT), pp. 317–328.
VLDB-2000-LuL #classification #scalability: Decision Tables: Scalable Classification Exploring RDBMS Capabilities (HL, HL), pp. 373–384.
CIKM-1999-CheungZKLLT #design: Requirement-Based Data Cube Schema Design (DWLC, BZ, BK, HL, TWL, HFT), pp. 162–169.
CIKM-1999-FengLYH #mining #transaction: Mining Inter-Transaction Associations with Templates (LF, HL, JXY, JH), pp. 225–233.
KDD-1999-TungLHF #mining #transaction: Breaking the Barrier of Transactions: Mining Inter-Transaction Association Rules (AKHT, HL, JH, LF), pp. 297–301.
CIKM-1998-TungTL #mining #named #online #optimisation #using: BROOM: Buffer Replacement using Online Optimization by Mining (AKHT, YCT, HL), pp. 185–192.
VLDB-1995-LuSL #approach #data mining #mining #named: NeuroRule: A Connectionist Approach to Data Mining (HL, RS, HL), pp. 478–489.
VLDB-1995-LuTD #adaptation #approach #optimisation #query: The Fittest Survives: An Adaptive Approach to Query Optimization (HL, KLT, SD), pp. 251–262.
VLDB-1994-LuOT #on the: On Spatially Partitioned Temporal Join (HL, BCO, KLT), pp. 546–557.
SIGMOD-1992-LowOL #named: H-trees: A Dynamic Associative Search Index for OODB (CCL, BCO, HL), pp. 134–143.
VLDB-1992-ChanOL: Extensible Buffer Management of Indexes (CYC, BCO, HL), pp. 444–454.
VLDB-1990-LuTS #algorithm #multi: Hash-Based Join Algorithms for Multiprocessor Computers (HL, KLT, MCS), pp. 198–209.
SIGMOD-1988-RamnarayanL #knowledge base #query: A Data/Knowledge Base Management Testbed and Experimental Results on Data/Knowledge Base Query and Update Processing (RR, HL), pp. 387–395.
SIGMOD-1987-RichardsonLM #algorithm #design #evaluation #parallel #pipes and filters: Design and Evaluation of Parallel Pipelined Join Algorithms (JPR, HL, KPM), pp. 399–409.
VLDB-1987-Lu #database #transitive: New Strategies for Computing the Transitive Closure of a Database Relation (HL), pp. 267–274.
SIGMOD-1986-CareyL #database #distributed: Load Balancing in a Locally Distributed Database System (MJC, HL), pp. 108–119.
VLDB-1985-LuC #algorithm #distributed #network: Some Experimental Results on Distributed Join Algorithms in a Local Network (HL, MJC), pp. 292–304.