default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWee Hyong Tok
Person information
- affiliation: National University of Singapore (NUS)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2015
[b1]Roger S. Barga, Valentine Fontama, Wee Hyong Tok:
Predictive Analytics with Microsoft Azure Machine Learning - Build and Deploy Actionalbe Solutions in Minutes, Second Edition. Apress 2015, ISBN 978-1-484212-01-1, pp. I-XXIII, 1-291
Journal Articles
- 2012
- [j2]Bin Cui
, Zhe Zhao, Wee Hyong Tok:
A Framework for Similarity Search of Time Series Cliques with Natural Relations. IEEE Trans. Knowl. Data Eng. 24(3): 385-398 (2012) - 2005
- [j1]Yongluan Zhou, Beng Chin Ooi, Kian-Lee Tan, Wee Hyong Tok:
An adaptable distributed query processing architecture. Data Knowl. Eng. 53(3): 283-309 (2005)
Conference and Workshop Papers
- 2024
- [c20]Karina Gibert, Wee Hyong Tok, Miquel Sànchez-Marrè:
KDD 2024 Special Day - AI for Environment. KDD 2024: 6695-6696 - [c19]Ankur Teredesai, Michael Zeller, Mohak Shah, Shenghua Bao, Wee Hyong Tok, Linsey Pang:
The 2nd International Workshop: From Innovation to Scale (I2S) - Successfully Build, Commercialize, and Scale AI Innovations. KDD 2024: 6739-6740 - [c18]Ye Xing, Jun Huan, Wee Hyong Tok, Cong Shen, Johannes Gehrke, Katherine Lin, Arjun Guha, Omer Tripp, Murali Krishna Ramanathan:
NL2Code-Reasoning and Planning with LLMs for Code Development. KDD 2024: 6745-6746 - 2023
- [c17]Ankur Teredesai, Michael Zeller, Shenghua Bao, Wee Hyong Tok, Linsey Pang:
From Innovation to Scale (I2S) - Discuss and Learn How to Successfully Build, Commercialize, and Scale AI Innovations in Challenging Market Conditions. KDD 2023: 5888-5889 - 2010
- [c16]Xuesong Lu, Wee Hyong Tok, Chedy Raïssi, Stéphane Bressan:
A Simple, Yet Effective and Efficient, Sliding Window Sampling Algorithm. DASFAA (1) 2010: 337-351 - [c15]Zhe Zhao, Bin Cui, Wee Hyong Tok, Jiakui Zhao:
Efficient similarity matching of Time Series Cliques with natural relations. ICDE 2010: 908-911 - 2009
- [c14]Mong-Li Lee, Wynne Hsu, Ling Li, Wee Hyong Tok:
Consistent Top-k Queries over Time. DASFAA 2009: 51-65 - 2008
- [c13]Wee Hyong Tok, Stéphane Bressan, Mong-Li Lee:
Twig'n Join: Progressive Query Processing of Multiple XML Streams. DASFAA 2008: 546-553 - [c12]Wee Hyong Tok, Stéphane Bressan, Mong-Li Lee:
A stratified approach to progressive approximate joins. EDBT 2008: 582-593 - 2007
- [c11]Wee Hyong Tok, Stéphane Bressan, Mong-Li Lee:
RRPJ: Result-Rate Based Progressive Relational Join. DASFAA 2007: 43-54 - [c10]Wee Hyong Tok, Stéphane Bressan, Mong-Li Lee:
Danaïdes: Continuous and Progressive Complex Queries on RSS Feeds. DASFAA 2007: 1115-1118 - [c9]Wee Hyong Tok, Stéphane Bressan, Mong-Li Lee:
Progressive High-Dimensional Similarity Join. DEXA 2007: 233-242 - 2006
- [c8]Wee Hyong Tok, Stéphane Bressan:
Processing of Multiple Long-Running Queries in LargeScale Geo-Data Repositories. DEXA Workshops 2006: 627-631 - [c7]Wee Hyong Tok, Stéphane Bressan:
DBNet: A Service-Oriented Database Architecture. DEXA Workshops 2006: 727-731 - [c6]Wee Hyong Tok, Stéphane Bressan, Mong-Li Lee:
Progressive Spatial Join. SSDBM 2006: 353-358 - 2003
- [c5]Wee Siong Ng, Beng Chin Ooi, Yanfeng Shu, Kian-Lee Tan, Wee Hyong Tok:
Efficient Distributed CQ Processing using Peers. WWW (Posters) 2003 - 2002
- [c4]Wee Hyong Tok, Stéphane Bressan:
dbRouter - A Scaleable and Distributed Query Optimization and Processing Framework. DEXA 2002: 658-668 - [c3]Wee Hyong Tok, Stéphane Bressan:
Efficient and Adaptive Processing of Multiple Continuous Queries. EDBT 2002: 215-232 - [c2]Wai Lup Low, Wee Hyong Tok, Mong-Li Lee, Tok Wang Ling:
Data Cleaning and XML: The DBLP Experience. ICDE 2002: 269 - [c1]Wee Hyong Tok, Twee-Hee Ong, Wai Lup Low, Indriyati Atmosukarto, Stéphane Bressan:
Predator-Miner: Ad hoc Mining of Associations Rules within a Database Management System. ICDE 2002: 327-328
Parts in Books or Collections
- 2013
- [p1]Wee Hyong Tok, Stéphane Bressan:
Progressive and Approximate Join Algorithms on Data Streams. Advanced Query Processing (1) 2013: 157-185
Reference Works
- 2018
- [r4]Wee Hyong Tok:
Distributed Deadlock Management. Encyclopedia of Database Systems (2nd ed.) 2018 - [r3]Wee Hyong Tok:
Distributed Transaction Management. Encyclopedia of Database Systems (2nd ed.) 2018 - 2009
- [r2]Wee Hyong Tok:
Distributed Deadlock Management. Encyclopedia of Database Systems 2009: 899-903 - [r1]Wee Hyong Tok:
Distributed Transaction Management. Encyclopedia of Database Systems 2009: 925-929
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
